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,
![15 Sorting Algorithms in 6 Minutes](https://cdn-ak-scissors.b.st-hatena.com/image/square/2c212877bd272580d013a38df518c1cfafe130dd/height=288;version=1;width=512/https%3A%2F%2Fi.ytimg.com%2Fvi%2FkPRA0W1kECg%2Fhqdefault.jpg)