In quick sort, for sorting n elements, the (n/4)th smallest element is selected as a pivot using an O(n) time algorithm. What is the worst-case time complexity of the quick sort?
(A) θ(n)
(B) θ(n*log(n))
(C) θ(n^2)
(D) θ(n^2 log n)
(A)
A
(B)
B
(C)
C
(D)
D
Answer: (B)
Explanation:
The recursion expression becomes T(n) = T(n/4) + T(3n/4) + cn
After solving the above recursion, we get θ(n*log(n)).
Quiz of this Question
Please comment below if you find anything wrong in the above post