Heap Sort

Timo Bingmann
Timo Bingmann
216.1 هزار بار بازدید - 11 سال پیش - Visualization and "audibilization" of the
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 http://panthema.net/2013/sound-of-sor...
11 سال پیش در تاریخ 1392/02/29 منتشر شده است.
216,118 بـار بازدید شده
... بیشتر