# 15 Sorting Algorithms in 6 Minutes


![](https://cdn.hashnode.com/res/hashnode/image/upload/v1743071224651/222e5d0b-9c17-4cbb-8301-3b7ec6308fcf.gif)

> 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 at [the "Sound of Sorting"](http://panthema.net/2013/sound-of-sorting/)