Heap Sort

To perform the heap sort we must:

1. Create a heap (a tree with all nodes greater than their children)

2. Remove the root elements from the heap one at a time, recomposing the heap

Let’s start by looking at forming the heap

Previous slide

Next slide

Back to first slide

View graphic version