Skip to content
0:00 / 0:00

#sortingalgorithms#visualization#sonification

15 Sorting Algorithms in 6 Minutes

Timo Bingmann

46K subscribers • 1 video on Hallway

YouTube
  • Recommended by 9 people: 4 on Hacker News, 4 in engineering communities and 1 curated list.
  • A classic. People kept recommending it from 2013 to 2023.

Beginner. No background in the topic needed.

29M views13 years ago9 recommendations

Computer scienceAlgorithmsData structures

A visual and audio demonstration of fifteen sorting algorithms running on shuffled integers to compare their complexity and behavior.

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 panthema.net/2013/sound-of-sorting

Why it's here

9 people recommend this, 1 disputes it

What people say. Widely recommended as a fascinating and satisfying visualization of sorting algorithms that helps viewers intuitively understand their behavior.

u/cspkin r/compsci • Recommends

15 Sorting Algorithms in 6 Minutes

u/Phoxein r/compsci • Recommends

Visualization and 'audibilization' of 15 sorting algorithms

u/masturbatingPotatoin r/compsci • Recommends

Data sorting algorithms with visual and audio representations

Coding Interview Universitycurated list on GitHubRecommends

Under “Sorting”

As a summary, here is a visual representation of 15 sorting algorithms.

Artemis2on Hacker News • Recommends

On “Illustrated Sorting Algorithms”

Fascinating! Another sorting visualization that I like is this one: link to this video . It is well-known but the way everything falls back into place at each time... that's very satisfying.

jerfon Hacker News • Recommends

On “Quadsort: a stable non-recursive merge sort”

You may enjoy this: link to this video There are several similar videos on YouTube demonstrating sorts. If that's a bit sterile for you, you can get a more human touch via the playlist link

bestboyon Hacker News • Recommends

On “Bubblesort, rocksort, and cocktail-shaker sort”

just want to quickly share an IMHO interesting sorting algorithm visualization video: link to this video "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)."

hot_grilon Hacker News • Recommends

On “Ask HN: What's your favorite illustration in Computer Science?”

The classic sorting algo videos with sound come to mind first: link to this video . Mergesort is my favorite video. The main resource on learning Erlang, link , has a lot of funny ones, some of which are useful.

u/Buck_McFucksonin r/compsci • Recommends

15 Sorting Algorithms in 6 Minutes - (xpost - /r/oddlysatisfying)

Jeff_Brownon Hacker News • Disputes

On “Linuxwave: Generate Music from the Entropy of Linux”

I was hoping for something less sanitized, that gives more insight into what the processor is doing, like this: link to this video This, though, falls into the enormous genre of algorithms that take some cool phenomenon (often pi) and then quantize it to some tempo, and some scale, and some set of samples, thereby killing everything that was interesting about the original phenomenon.

u/bubba_lexiin r/compsci • Mentions

On “Sorting Algorithms Visualized [gifv]”

here's another visualization with sound. I really like the bloops when its checking at the end!

u/pomfrittenin r/C_Programming • Mentions

On “Blitsort: An in-place stable sorting algorithm faster than qsort and pdqsort”

We want sound: link to this video

u/faceplantedin r/compsci • Mentions

On “A Love Letter To Conway's Game of Life”

Not in any way the same thing, but you should learn a visual language like Processing, something a canvas that lets you easily make visualisations, when I first heard about Conway's Game of Life I immediately made one and then started adding colours and colour mixing when the cells breed to see how much things actually move around vs making local clusters and such, it really helped me understand what was going on. In college I made visualisations of sorting algorithms for the same reason, obviously they already exist, but making my own really helped my understanding before my exams. If all else fails `import turtle`

u/pseudousernamein r/compsci • Mentions

On “Animations of sort algorithms on Wikipedia”

I am just going to leave this here: link to this video

u/Nathan340in r/compsci • Mentions

On “Traveling Salesman Problem Visualization”

Here's a visualization of sorting algorithms. link to this video

u/crwcomposerin r/compsci • Mentions

On “How to visually represent original sorting algorithms?”

You mean like this? link to this video They provide their source in the description.