Skip to content
Related Articles

Related Articles

Improve Article

GATE | GATE CS 2013 | Question 30

  • Last Updated : 28 Jun, 2021

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 https://www.geeksforgeeks.org/algorithms-sorting-question-21/

Quiz of this Question

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :