GATE Computer Science (CS) 2013 Solved Paper

Question : 40 of 65

Marks: +1, -0

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