15 Sorting Algorithms in 6 Minutes

A very nice video explaining 15 sorting algorithms in less than 6 minutes

Posted by Shubham Chaudhary on August 5, 2013


Awesome Video ! ! !
Visualization and "audibilization" of 15 Sorting Algorithms in 6 Minutes. Totally worth the time.
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.