The following video offers a fantastic visual (and musical) demonstration of how different integer sorting algorithms work showing their speed and the number of operations involved.

The algorithms featured are: selection sort, insertion sort, quicksort, mergesort, heapsort, radix sort (LSD), radix sort (MSD), std::sort (introsort), std::stable_sort (adaptive mergesort), shell sort, bubble sort, cocktail shaker sort, gnome sort, bitonic sort, and bogo sort (30 seconds each).

It’s a brilliant way to bring together algorithms, rhythm, and music. Absolutely mind-blowing!If you want to explore how different sorting algorithms work: sorting.at.

More information: here.