Given A = (4, 8, 10, 11, -7, 2, 21) The following is the step by step sorting algorithm : step 1. A = (-7, 8, 10, 11, -4, 2, 21) step 2. A = (-7, -4, 10, 11, 8, 2, 21) what is the value of A in step 3 ? OF7, -4, 2, 8, 10, 11, 21) Ot7, 4, 2, 11, 8, 10, 21) OF7, -4, 2, 8, 11, 10, 21) O(7. 4, 2, 10, 11,8, 21)

Q: Below is the pseudocode of the randomized selection algorithm: Randomized - Select (A, p, r, i) if p…

A: Solution :- while true     if p == r         return A[p]            //Find an index from random…

Q: 1. (a) Use the least significant digit first radix sort to sort the following 3-digit numbers, 187,…

A: In Radix sort algorithm the numbers are sorted based on the least significant bit first then they…

Q: earch the numbers in the following list [4,9,10,32,56,85,90,120] Using Linear Search and Binary…

A: 1) Linear search is a search that finds an element in the list by searching the element sequentially…

Q: Given the following list of numbers, show the 3rd number in the list after the 3rd pass of the…

A: Insetion sort: The insertion kind, though still O(n2), works during a slightly totally different…

Q: Given the following list of numbers, show the 2nd number in the list after the 2nd pass of the…

A: I have given code in step2

Q: Sort the following in order of asymptotic order: f1(n) = n" f2(n) = nvn f3(n) = 2" fa(n) = f4(n/2) +…

A: The fourth equation needs to be converted to an asymptomatic notation. Using Master's theorem:…

Q: We have tuples of dates of the form (rrxx(year), rr(month), rr(date)). Which sorting algorithm would…

A: Any

Q: Which sorting algorithm is regarded as the most efficient in terms of performance?

A: Which sorting algorithm is regarded as the most efficient in terms of performance? Answer is…

Q: Given the following list of numbers, show the 1st number in the list after the 1st pass of the…

A: Insertion Sort: The insertion kind, although still O(n2), works throughout a rather altogether…

Q: This is the illustration for the execution of the selection-sort algorithm on the input sequence…

A: Lets understand how selection sort works: it finds minimum element for every ith position in…

Q: One disadvantage of using a For-loop in sorting algorithms is that the body of the For-loop is…

A: We need to write a version of Bubble Sort that avoids unnecessary comparisons. The idea here is to…

Q: 1 Sequence (46, 79, 56, 38, 40, 84), using quick sorting (with the leftmost element as the pivot),…

A: Actually, sorting is a data elements are arranged in order(ascending/descending)

Q: Order these three sorting algorithms according to their BEST-case running time. The fastest should…

A: Explanation: The following shows the best-case running time for the given algorithms: The…