Heap Sort Reference Implementation
A reference implementation of heap sort using a priority queue in modern C++ as described in Chapter 4 of The Algorithm Design Manual by Steven S. Skiena. This algorithm will run in O(n lg n) time with n elements.
BDD testing provided with Catch2. Run single unit test with make check from top level directory.