Multiple choice

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

  1. $\Theta(n)$
  2. $\Theta(n \log n)$
  3. $\Theta(n^2)$
  4. $\Theta(n^2 \log n)$
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Keep practicing — related questions