Heap Sorting Algorithm

Question

I need the algorithm of HeapSort for sorting the elements of the array, such that all the elements of the array i.e [19 18 14 15 5 7 13 3 8] are in non-decreasing order.

Answer 1

Read about Heapsort here. A nice pseudocode has also been provided.

Answer 2

Heapsort is pretty simple. You grab all elements, put them in a heap (in your case, a max-heap) in any order and then grab them back from the heap (with the delete-max operation) and they come all sorted up.

Answer 3

I prefer the C language because it can be understand easily