15 Sorting Algorithms in 6 Minutes
25,958,978 views 11 years ago
Visualization and "audibilization" of 15 Sorting Algorithms in 6 Minutes. Sorts random shuffles of integers, with both speed and the number of items adapted to each algorithm's complexity. The algorithms are: selection sort, insertion sort, quick sort, merge sort, heap sort, radix sort (LSD), radix sort (MSD), std::sort (intro sort), std::stable_sort (adaptive merge sort), shell sort, bubble sort, cocktail shaker sort, gnome sort, bitonic sort and bogo sort (30 seconds of it). More information on the "Sound of Sorting" at http://panthema.net/2013/sound-of-sor...
All videos of the sorting algorithms ordered to show different asymptotics. The algorithms' speed is slowed down far enough to actually see how it exchanges items. Once the algorithms loops repeat the sorting on other areas, the video speed is accelerated to not be too boring.

Insertion Sort

Timo Bingmann
336K views11 years ago

Merge Sort

Timo Bingmann
277K views11 years ago

Heap Sort

Timo Bingmann
230K views11 years ago