Heap Sort: Sorting

• Turn List into a Heap

• Swap head of list with last key in heap

• Reduce heap size by one

• Call FixHeap on the root

• Repeat for all keys until list is sorted

Previous slide

Next slide

Back to first slide

View graphic version