The number of elements that can be sorted in \(Θ(log \ n)\) time using heap…

GATE · 2013 · CS · Computer Science & IT

1. A.

   $Θ(1)$

2. B.

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

3. C.

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

4. D.

   $\Theta(\log n)$

Attempted by 720 students.