15 Sorting Algorithms in 6 Minutes

15 Sorting Algorithms in 6 Minutes
1652379216 maxresdefault.jpg

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

source – If Video Not Display Click Here

15 Sorting Algorithms in 6 Minutes

Responses (24)

  1. my favourite sounding ones are bogo sort, stable sort & merge sort. least favourite is quick sort because it sounds like a swarm of bats flying towards you

  2. Could someone explain, as if explaining to an 8 year old, what the hell is going on here? I hate feeling ignorant and would love to be educated

  3. My lungs are burning from how hard I laughed at the bogosort visualization, and how the video just ends without it being completed. I don't know why that's so funny

Comments are closed.