15 sorting algorithms in 6 minutes (2013) [video]

Hacker News Top Tools
sorting-algorithms visualization algorithm computer-science educational video

Summary

A 2013 video visualizing and audibilizing 15 sorting algorithms in 6 minutes, including selection sort, quick sort, and bogo sort.

No content available
Original Article
View Cached Full Text

Cached at: 06/25/26, 05:15 AM

# 15 sorting algorithms in 6 minutes (2013) [video] **Channel:** akkartik Source: [https://www.youtube.com/watch?v=kPRA0W1kECg](https://www.youtube.com/watch?v=kPRA0W1kECg) ## Description 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 http://panthema.net/2013/sound-of-sorting

Similar Articles

Sorting, hashing, and sketches on 370,103 words

Hacker News Top

A technical blog post that explores sorting, hashing, and sketching algorithms on a dataset of 370,103 English words, measuring time and memory costs, with a focus on practical implementations like binary search, quicksort, and HyperLogLog.

Your code is fast – if you're lucky

Hacker News Top

This article presents a branchless Quicksort implementation using sorting networks and discusses how modern compilers, especially Clang, optimize loops with branch-free instructions when written in the right style.

Branchless Quicksort faster than std:sort and pdqsort with C and C++ API

Hacker News Top

A new branchless Quicksort implementation (blqsort) using sorting networks outperforms std::sort and pdqsort on Apple M1 and AMD Ryzen systems, available as single-header C and C++ libraries. It achieves speedups through branchless partitioning, median-of-medians pivot selection, and custom sorting networks for small arrays.