Heap Sort

Visualization and “audibilization“ of the Heap Sort algorithm. Sorts a random shuffle of the integers [1,100] using max-heap sort. First builds a heap in the array by sifting down smaller element. The levels of the heap are lightly colored once heapified. The animation is slowed down during the video to give you time to see how the algorithm works. More information on the “Sound of Sorting“ at