Good video on what Heap Sort is: https://www.youtube.com/watch?v=2DmK_H7IdTo
Heap Sort is an O(nlog(n)) sort, which is a good time complexity. It is also space efficient as it is done in place.
The best thing about Heap Sort is that you can break it into parts: O(n) heapify, and n* O(log(n)) heappops. This means it can be used as a priority queue incredibly well.
