ou have an array of 10,000 subject scores for a high-school exam and you want to find the scores that are ranked from 4900 to 5100 that is the 201 most middle-ranked scores. Precisely describe two alternative algorithmic ap proaches to doing this - one of which is, in terms of time complexity, more efficient than the other.

ou have an array of 10,000 subject scores for a high-school exam and you want to find the scores that are ranked from 4900 to 5100 that is the 201 most middle-ranked scores. Precisely describe two alternative algorithmic ap proaches to doing this - one of which is, in terms of time complexity, more efficient than the other.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

You are given two different methods for sorting the values in an array: Sort1 and Sort2. You have determined that Sort1 = O(nlog n) and Sort2 = O(n2). You need to choose one of these two sorting methods to sort lists in a program you are writing, but you would like to choose the one which completes the fastest. Given this information, is either of these two methods guaranteed to be complete faster than the other? If so, explain which one is faster and why. If not, explain why not.
In this programming assignment, you are expected to design an experimental study for thecomparison between Hoare’s partitioning and Lomuto’s partitioning in Quicksort algorithm.You must implement the recursive Quicksort algorithm using two partitioning algorithms inJava. You must design the experiments for the comparison of two algorithms both theoreticallyand empirically. You must write a detailed report including the pseudo-code of the algorithms,the time complexity of the algorithms, the experimental design, and your results. You canprovide some plots (scatter, line etc.) to illustrate your results.
Given two arrays A and B of equal size N, the task is to find if given arrays are equal or not. Two arrays are said to be equal if both of them contain same set of elements, arrangements (or permutation) of elements may be different though.Note : If there are repetitions, then counts of repeated elements must also be same for two array to be equal. Example 1: Input: N = 5 A[] = {1,2,5,4,0} B[] = {2,4,5,0,1} Output: 1.
Correct answer will be upvoted else downvoted. Computer science. single activity, you should supplant each digit d of the number with the decimal portrayal of integer d+1. For instance, 1912 becomes 21023 in the wake of applying the activity once. You need to find the length of n subsequent to applying m tasks. Since the appropriate response can be exceptionally enormous, print it modulo 109+7. Input The main line contains a solitary integer t (1≤t≤2⋅105) — the number of experiments. The main line of each experiment contains two integers n (1≤n≤109) and m (1≤m≤2⋅105) — the underlying number and the number of activities. Output For each experiment output the length of the subsequent number modulo 109+7.
You want to design an algorithm, called minMax(A,p,r), that takes an array of integers and indexes of the first and last elements, and returns the minimum and maximum values in that range. Now write the pseudo code of a divide and conquer (and therefore, recursive) algorithm with the same time complexity (Θ(n)). You can assume that p ≤ r. Also, in your code, you can return two numbers by returning a pair, e.g. “return (a, b)”, and can save the output in a similar way, e.g. “(a, b) = minMax(parameters)”. (Short answer please)
A graph is a collection of vertices and edges G(V, E). A weighted graph has weights (numbers, etc.) on every edge. A multigraph can have more than one edges between any vertices. Explain why a person should use a weighted graph instead of a multigraph. Give examples. An adjacency matrix might be a better choice for speeding up a program, however, it consumes huge memory for large graphs. How this situation can be improved? What programming constructs better suit graph representation? Explain with example
The puzzle called the Towers of Hanoi consists of three pegs, one of which contains several rings stacked in order of descending diameter from bottom to top. The problem is to move the stack of rings to another peg. You are allowed to move only one ring at a time, and at no time is a ring to be placed on top of a smaller one. Observe that if the puzzle involved only one ring, it would be extremely easy. Moreover, when faced with the problem of moving several rings, if you could move all but the largest ring to another peg, the largest ring could then be placed on the third peg, and then the problem would be to move the remaining rings on top of it. Using this observation, develop a recursive algorithm for solving the Towers of Hanoi puzzle for an arbitrary number of rings.
Note: Answer the question using Java language only. Shaker is the first child who got scholarship into the village. He went to London to study where he finds it very interesting to calculate number of ways of going to point (c, d) from point (a, b) in co-ordinate plane. We can take horizontal and vertical steps only and cannot visit at a point twice. In a step, you can move one unit only. We have to reach to the point (c, d) from the point (a, b) using abs(a-c) + abs(b-d) steps only. Shaker has two sets of points. Set A contains points having X co- ordinate 0 and Y co-ordinates varying from 1 to N (both inclusive). Set B contains points having X co-ordinate K and Y co-ordinates varying from 1 to N (both inclusive). Both sets contain N number of integral points. He wants to calculate the sum of number of ways to going to each point of set B from each point of set A. Input 1 22 Output 8
You are advised to refer to the recommended textbook “Introduction to Algorithms (3rdedition) by Thomas H. Corman, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein”. Have areading through Chapter 04 and answer the following questions as a follow up exercise Compute big-oh of the given T(n) using the Iteration Method:
6. There are currently several online newspapers in Bangladesh, such as prothom Alo, bdnews24, daily star, Bangla tribunes, etc. Suppose you have access to these online newspapers contest and want to group them into a set of articles about the same story (e.g., all the sports news of all these newspapers will appear in the same place). What type of algorithms will you use to perform such kind of operation above? What are the motivations for choosing your algorithm? Explain.
Write in python programming language: The Longest Subsequence Problem is a well-studied problem in Computer Science, where given a sequence of distinct positive integers, the goal is to output the longest subsequence whose elements appear from smallest to largest, or from largest to smallest. For example, consider the sequence S= [9,7,4,10,6,8,2,1,3,5]. The longest increasing subsequence of S has length three ([4,6,8] or [2,3,5]), and the longest decreasing subsequence of S has length five([9,7,4,2,1] or [9,7,6,2,1]). And if we have the sequence S = [531,339,298,247,246,195,104,73,52,31], then the length of the longest increasing subsequence is 1 and the length of the longest decreasing subsequence is 10. Question: Find a sequence with nine distinct integers for which the length of the longest increasing subsequence is 3, and the length of the longest decreasing subsequence is 3. Briefly explain how youconstructed your sequence. Let S be a sequence with ten distinct integers. Prove by…
The Binary Search algorithm works by testing a mid-point, then eliminating half of the list. In this exercise, you are going to take our binary search algorithm and add print statements so that you can track how the search executes. Inside of the recursive binary search function, add print statements to print out the starting, ending, and midpoint values each time. Then as you test a value, print out the results, either too high, too low, or a match. Sample Output Starting value: 0 Ending value: 9 Testing midpoint value: 4 Too high! Starting value: 0 Ending value: 3 Testing midpoint value: 1 Too low! Starting value: 2 Ending value: 3 Testing midpoint value: 2 Match! public class BinaryExplorer { public static void main(String[] args) {int[] testArray = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; binaryRec(testArray, 8, 0, testArray.length - 1); } /*** Add Print statements to the binaryRec method:* * Print Starting, ending, and midpoint values.* * Print when you find a match* * Print if you are…