Design an algorithm in pseudocode elements of a given array of n real numbers so that all its negative elements precede all its positive elements. Your algorithm should be both time efficient and space efficient. What is the time efficiency class of your algorithm? to rearrange

Suppose that, even unrealistically, we are to search a list of 700 million items using Binary Search, Recursive (Algorithm 2.1). What is the maximum number of comparisons that this algorithm must perform before finding a given item or concluding that it is not in the list? Solution: 고

Design an algorithm in pseudo code to rearrange elements of a given array of n real numbers so that all its negative elements precede all its positive elements. Your algorithm should be No worse than Θ(n). Sample input: A = {-1, 4, -4, 3, 5, -2, 7, 8, 9, -10}

The following algorithm adds all the entries in the “upper triangular” part of a square n × n array A. Consider n = 5 and the 5 × 5 array below. The work unit is the addition operation, sum = sum + A[k, j]. How many times is the sum = sum + A[k, j] operation done? sum = 0 for k = 1 to n do for j = k to n do sum = sum + A[k, j] end for end for 1 3 1 0 2 3 1 0 3 3 0 0 1 2 0 0 2 3 1 2 2 2 3 0 1

Describe an algorithm for finding the 10 largest elements in an array of size n. What is the running time of your algorithm?

Suppose that each row of an n × n array A consists of 1's and 0's such that in any row of A all the 1's come before any O's in that row. Assuming that A is already in memory, describe an algorithm running in O(n) time for finding the row that contains the most 1's. Write the algorithm following the style of your course-notes.

Write an efficient algorithm for the following problem (either pseudocode or java), and describe your reasoning. Determine the Time complexity and if you cannot find any polynomial time algorithm, then give a backtracking algorithm. Problem will be on repeat numbers input will be ARRAY[1,2, ... , n] number of positive numbes. Output will any one number that is repeated more than n/3 times. for example, if you have [1,1,2,2,2,1], since n = 6 and n/3 = 2, both 1 and 2 showed up more than n/3 times. the output will be either 1 or 2 (just one of the values are required)   if you have [1,1,3,4,5,6,7,8,9], since 1 is only repeated twice, and n/3 = 3, output will be "none"

Assume that you are given an array containing n integer numbers from the set {0, 1, . . . , k} for some k ≤ n. Design an algorithm to produce a sorted array containing those n numbers in non-decreasing order in time O(n). Present the pseudocode for the algorithm and provide a justification for its running time.

We need assistance with algorithm design.   Create an algorithm that, given an array of numbers, outputs a new array in which each number has an equal chance of appearing in each position.

What is the best-time complexity for the function that compares the items in array of the size n with the number x? B(n) = 1 B(n) = n B(n) = lg(n) B(n) = n²