Learn how heap sort works, what are its pros and cons, and how you can implement it in Python using the heapq module. Heap sort is a fast and efficient sorting algorithm that uses a heap structure.

This is a pretty basic program I wrote to explain heaps to a friend of mine. It is written in C, and uses a custom Node type. It supports the ability to add nodes to the heap, and to display the nodes ...