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)
m = \lfloor an \rfloor
badSort(A[0...m - 1])
badSort(A[n - m...n - 1])
badSort(A[0...m - 1])
1
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.