GATE | GATE CS 2013 | Question 30
The number of elements that can be sorted in (log n) time using heap sort is
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.