Q52

MCQ2 marks, −0.5

The median of $n$ elements can be found in $O(n)$ time. Which one of the following is correct about the complexity of quick sort, in which median is selected as pivot?

(A)

$\Theta (n)$

(B)

$\Theta (n \log n)$

(C)

$\Theta (n^{2})$

(D)

$\Theta (n^{3})$

Loading…