15 Sorting Algorithms in 6 Minutes
Master dregree in Physics in scattering theory. PhD in Physics in group theory (ray representation in quantum mechanics). After a master in e-learning I'm Chief Editor / Deputy Editor for EduINAF, INAF magazine about outreach and astronomy education.
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"
