Q30

MCQ2 marks, −0.67

The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is

(A)

$\Theta(1)$

(B)

$\Theta(\sqrt{\log} n)$

(C)

$\Theta(\frac{\log n}{\log \log n})$

(D)

$\Theta(\log n)$

Loading…