EssayproSolutions

Problem 4 Consider Following Pseudocode Sorting Algorithm 0 1 Badsort 0 N 1 N 2 0 1 Swap Q43899188

Consider the following pseudocode for a sorting algorithm…

Problem 4. Consider the following pseudocode for a sorting algorithm, for 0 < a <1 and n > 1. badSort(A[0 -.-n – 1]) if (n = 2) and (A[0] > A[1]) swap A[0] and A[1] else if (n > 2) [a n] badSort(A[0 -.. m – 1]) badSort(A[n – m..n – 1) badSort(A[0 … m – 1]) %3D т 3 Problem 4.a. (3 points) Show that the divide and conquer approach of badSort fails to sort the input array if a < 1/2. Problem 4.b. (2 points) Does badSort work correctly if a = 3/4? If not, why? Explain how you fix it. Problem 4.c. (2 points) • State a recurrence (in terms of n and a) for the number of comparisons performed by badSort. Problem 4.d. (2 points) • Let a = 2/3, and solve the recurrence to determine the asymptotic time complexity of badSort. %3D Show transcribed image text Problem 4. Consider the following pseudocode for a sorting algorithm, for 0 A[1]) swap A[0] and A[1] else if (n > 2) [a n] badSort(A[0 -.. m – 1]) badSort(A[n – m..n – 1) badSort(A[0 … m – 1]) %3D т 3 Problem 4.a. (3 points) Show that the divide and conquer approach of badSort fails to sort the input array if a

Expert Answer

Answer to Problem 4. Consider the following pseudocode for a sorting algorithm, for 0 < a 1. badSort(A[0 -.-n – 1]) if (n = 2) a...