15 Sorting Algorithms in 6 Minutes

15 Sorting Algorithms in 6 Minutes
Timo Bingmann

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 https://panthema.net/2013/sound-of-sorting/

https://youtu.be/kPRA0W1kECg

https://heisme.skymoon.info/article/SuggInfo/1431  

어지러진 발자국이 새겨진 보도(步道) 블록 사이에 작은 민들레 꽃 바로 그것일까? [하늘-사람들 I (길위에서)]