2,033 views
0 votes
0 votes

Q) Suppose we are sorting an array of eight integers using heapsort, and we have just finished some heapify (either maxheapify or minheapify) operations.

The array now looks like this: (16 14 15 10 12 27 28 ) How many heapify operations have been performed on root of heap?

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
LavTheRawkstar asked Sep 9, 2018
1,059 views
Sort The Following Sequence of input using Heap sort.{ 10 , 2 , 1 , 5, 3 ,8 ,11,24 ,7 }Please show the output at every pass because i am getting confused.
9 votes
9 votes
2 answers
2
vineet.ildm asked Nov 7, 2016
5,918 views
Why space complexity of heapsort is O(1)....and why not O(logn)..because of space required by recursion calls which is equivalent to height of the tree...where am i getti...
1 votes
1 votes
1 answer
3
reena_kandari asked Jul 30, 2016
996 views
The number of elements that can be sorted in time using heap sort ?
1 votes
1 votes
1 answer
4
Himanshu1 asked Jan 20, 2016
1,294 views
What is the Best Case run time of Heap Sort ?A. $O(1)$B. $O(n)$C. $O(n \log n)$D. $O(\log n)$