In today's video, we look at implementing Heap Sort.
Heap sort is a recursive algorithm that takes advantage of the structure of data to sort. It applies it to a tree-based data structure called a heap (Max heap for our example). Once the data is in the Max Heap, it recursively pulls the largest value from the heap resulting in a sorted array.
In the video, we go over the setup, implement the algorithm, and then gather statistics to show our results.
