Gate2009_39

In quick sort, for sorting n elements, the (n/4)th smallest element is selected as pivot using an O(n) time algorithm. What is the worst case time complexity of the quick sort?

(A) \(\Theta\)(n)            (B) \(\Theta\)(n log n)          (C)  \(\Theta\)(n2 )          (D)  \(\Theta\)(n2 log n)

Discuss

1Comment
ALOK GUPTA @galok1001 8 Jul 2018 11:46 am

b