323 Views
So the steps to heapsort are as follows: build a max heap, so that the element with the greatest value is at the top. switch it with the last element and remove it from the heap. repeat steps one and two until the heap has only one element remaining.
0 comments