GATE | GATE CS 2013 | Question 30

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

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


Answer: (C)

Explanation: See http://quiz.geeksforgeeks.org/algorithms-sorting-question-21/

Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

1


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.