GATE | GATE CS 2013 | Question 30

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

(A) A
(B) B
(C) C
(D) D

Answer: (C)

Explanation: See

Quiz of this Question

My Personal Notes arrow_drop_up

Article Tags :

