Algorithms | Sorting | Question 2

Suppose we have a O(n) time algorithm that finds median of an unsorted array.

Now consider a QuickSort implementation where we first find median using the above algorithm, then use median as pivot. What will be the worst case time complexity of this modified QuickSort.
(A) O(n^2 Logn)
(B) O(n^2)
(C) O(n Logn Logn)
(D) O(nLogn)


Answer: (D)

Explanation: If we use median as a pivot element, then the recurrence for all cases becomes

T(n) = 2T(n/2) + O(n)

The above recurrence can be solved using Master Method. It falls in case 2 of master method.

Quiz of this Question



My Personal Notes arrow_drop_up



Practice Tags :

Recommended Posts:



3 Average Difficulty : 3/5.0
Based on 2 vote(s)






User Actions