The number of elements that can be sorted in time using heap sort is
(A) (B) (C) (d)
Explanation: Time complexity of Heap Sort is for m input elements. For m = , the value of will be which will be which is
Quiz of this Question
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.