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  

눈오는 강물을 바라본다. 아렴풋한 꿈속이듯 오랫동안 내 이렇게 있었다 [김남조-오늘]