15 Sorting Algorithms in 6 Minutes

5:50
3,136,929
46,456
482

Description

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-sorting

Related Videos

Leave a Reply

Your email address will not be published. Required fields are marked *