retagged by
1,272 views

1 Answer

Best answer
6 votes
6 votes
option C. Best, average and worst case time complexity of heap sort is $O(n \log n)$.
selected by

Related questions

1 votes
1 votes
1 answer
1
LavTheRawkstar asked Sep 9, 2018
1,031 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.
1 votes
1 votes
1 answer
2
reena_kandari asked Jul 30, 2016
988 views
The number of elements that can be sorted in time using heap sort ?
6 votes
6 votes
1 answer
4