(b) Now assume that one is given another list Bn = {bi} n i=1 of n distinct positive integers whose median mB is already known. Develop an algorithm that returns the sum of the two elements with value closest to mB, such that one of them is greater than mB and the other is lower than mB. Although sorting Bn would yield a quick solution, we will see later on that this is a exhorbitantly slow process and one can solve the problem without sorting Bn in singnificantly faster time. Hence, in your solution, Do Not Sort Bn and propose a solution that goes without Sorting. (c) State a loop invariant for the algorithm you proposed in part (b) above. (d) Prove the loop invariant you proposed in part (c) above.

(b) Now assume that one is given another list Bn = {bi} n i=1 of n distinct positive integers whose median mB is already known. Develop an algorithm that returns the sum of the two elements with value closest to mB, such that one of them is greater than mB and the other is lower than mB. Although sorting Bn would yield a quick solution, we will see later on that this is a exhorbitantly slow process and one can solve the problem without sorting Bn in singnificantly faster time. Hence, in your solution, Do Not Sort Bn and propose a solution that goes without Sorting. (c) State a loop invariant for the algorithm you proposed in part (b) above. (d) Prove the loop invariant you proposed in part (c) above.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter16: Searching, Sorting And Vector Type

Section: Chapter Questions

Problem 16SA

See similar textbooks

Similar questions

To add the two polynomials, assume that the singly linked lists' nodes are sorted in decreasing order of the variable x's exponents.The goal is to generate a new list of nodes representing the sum of P1 and P2. This is accomplished by combining the COEFF fields of nodes with identical powers of variable x in lists P1 and P2, and then creating a new node in the resultant list P1 + P2. The procedure's crux is presented below.P1 and P2 are the start pointers of the singly linked lists that represent polynomials P1 and P2. PTR1 and PTR2 are two temporary pointers that are initially set to P1 and P2, respectively. Make procedural code.
1. Consider a problem of computing the prefix average of a sequence of numbers stored in an array P consisting of P integers. We want to compute an array P such that P is the average of P for P . Consider the two algorithms related to the above problem. Answer the questions given below
Problem 2: Search an ArrayConsidering the search problem, we have a list of n integers A = ⟨v1, v2, · · · vn⟩. We wantto design an algorithm to check whether an item v exists or not such that it should returneither the index, i, if it was found or −1 otherwise, when not found.a) Implement the algorithm in Pythonb) Empirically, show the performance curve of the algorithm using time measurements.c) Using the basics of the theoretical analysis, write the complexity of its worst-casetime.d) Prove your algorithm is correct—it terminates with the valid output in every case
4 I enrolled in the Algorithms, Part II course on Coursera, and considering that the question is given after the Radix Sort lecture, I'm assuming the intent is to use one of the Radix Sorts. Given an unsorted array A[] of N 64-bit integers and a target value T, determine whether there aretwo distinct integers i and j such that a[i] + a[j] = T. Briefly explain why your algorithm is correct. Your algorithm should run O(N) in the worst case.
Problem 4: Divide and conquer.(i) Let A be an array containing n different integers. Elements in A are sorted inincreasing order. Given an integer x describe an algorithm which in time O(log n)finds an index i of x in A, that is, A[i] = x, where the length n of A is unknown(you may assume that the implementation of an array is such that for A[i], wherei > n, a special character ∞ is returned).(ii) Let A be an array containing n different integers. Elements in A are not necessarysorted. Given an integer x describe an algorithm which in time O(n log n) testswhether there exist two elements u and v in A such that their sum is equal to x, thatis, u + v = x. The length n of A is known.
Problem 6: Describe how to augment a skip list that supports the operation Select(S, k),which finds the k-th largest element in a skip list S with n elements. The expected timeof Select(S, k) should be O(log n)
To add the two polynomials, we assume that the singly linked lists' nodes are organized in decreasing order of the variable x's exponents.The goal is to generate a new list of nodes reflecting the sum of P1 and P2. This is accomplished by combining the COEFF fields of nodes with comparable powers of variable x in lists P1 and P2, and then adding a new node in the resultant list P1 + P2. The procedure's core is presented below.P1 and P2 are the beginning pointers of the singly linked lists that symbolize polynomials P1 and P2. Furthermore, PTR1 and PTR2 are two temporary pointers that are originally set to P1 and P2, respectively. Procedure code should be written.
7. For each of these lists of integers, provide a simple formula or rule that generatesthe terms of an integer sequence that begins with the given list. Assuming thatyour formula or rule is correct, determine the next three terms of the sequence.a. 3,6,11,18,27,38,51,66,83,102,...b. 7,11,15,19,23,27,31,35,39,43,...c. 1, 10, 11, 100, 101, 110, 111, 1000, 1001, 1010, 1011, . . .d. 1,2,2,2,3,3,3,3,3,5,5,5,5,5,5,5,...e. 0, 2, 8, 26, 80, 242, 728, 2186, 6560, 19682, . . .f. 1,3,15,105,945,10395,135135,2027025, 34459425, . . .g. 1,0,0,1,1,1,0,0,0,0,1,1,1,1,1,...h. 2, 4, 16, 256, 65536, 4294967296, . . .
solution should have O(l1.length + l2.length) time complexity, since this is what you will be asked to accomplish in an interview. Given two singly linked lists sorted in non-decreasing order, your task is to merge them. In other words, return a singly linked list, also sorted in non-decreasing order, that contains the elements from both original lists.
Consider the following recursive definition of list reversal. For a list L, rev(L) is defined: rev([]) = []rev(x : L) = rev(L) + [x] Please prove by induction on L that concatenation is left cancellative: L+M = L+N implies M = N. Please prove by induction on L that rev(rev(L)) = L for all lists L. Please prove by induction on L that rev(L + M ) = rev(M ) + rev(L) for all lists L and M . (Can utilize fact that concatenation = associative) Using 1, 2, and 3 to prove that concatenation is right cancellative as well: L + N = M + N implies L = M.
Here is my homwork problem: Problem 3. In the following array of C-strings char* names[] = { “DEF”, “BBB” , “EE”, “AA”, “CAB”, “AAA”, “DDDD”, “BBB”, “FFFF”, “CCCC”}; char* favoriteName= “AA”; Use generic binary search both iterative and recursive to find the favoriteName in the names array. If char names[][5] = { “DEF”, “BBB” , “EE”, “AA”, “CAB”, “AAA”, “DDDD”, “BBB”, “FFFF”, “CCCC”}; char* favoriteName= “AA”; What will be your call for search and explain any difference? Now dynamically allocate char**names and copy with all the names above and dynamically allocate char*favoriteName and copy with “AA” Make a call for the search _______________ *I am using C programming language for this problem* I made some code with iterative and recursive binary search functions, but only the iterative one finds the favorite name. Can you let me know what is wrong with my recursive binary search function as well as how to get it to work with the double array names[][5]? Here is my code:…
2. (20) Arrange the following functions in increasing order of big O, i.e., a function in your list must be big O of the next function. Give all justifications. nyn, 23 log log n, (log n)2, 2(log n), Vn3.1,nlcos nl, nlog n 2n, 3", n! to0)