Skip to content
Related Articles

Related Articles

Algorithms | Sorting | Question 17
  • Difficulty Level : Medium
  • Last Updated : 18 Feb, 2013
GeeksforGeeks - Summer Carnival Banner

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(nLogn)
(C) \theta(n^2)
(D) \theta(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 \theta(nLogn).

Quiz of this Question

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up
Recommended Articles
Page :