A thank you to Scott Janousek for posting to G+, this is a very cool find on his part.
“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).”
Best quote on the YouTube page: “Bogo sort doesn’t give a fuck.” Indeed it doesn’t 🙂 The phrase might be a clever yet crass t-shirt design to wear to a developer convention.