Nothing special here. It’s just a blog post for summarising my algorithm learning course. Probably this was taught in the University but I don’t remember anything, I have no idea about its definition and applications until I take this course. Part 1 here Binary Heap & Heapsort Summary - Part 1 - Binary Heap

# The Idea

- Start with array of keys in arbitrary order
- Create max-heap with all N keys.
- Repeatedly remove the maximum key (in place) to create a sorted array.