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

A 6-minute number video became the internet’s weirdly calming obsession

TLDR: A 2013 video showing 15 ways to put scrambled numbers in order racked up 27 million views by making math look hypnotic. In the comments, people were torn between calling it soothing, creepy, and starting a surprisingly heated argument over how to count each move.

A 13-year-old video about sorting numbers has somehow pulled in a jaw-dropping 27 million views, and the real show now is the crowd losing its mind in the comments. Creator Timo Bingmann turns 15 different ways of organizing scrambled numbers into a fast, colorful spectacle with matching sounds, and viewers are split between mesmerized and slightly alarmed. One person summed up the creepy side perfectly: it looks “frighteningly deterministic!” In plain English: everything moves with such cold, perfect order that people are both impressed and a little unnerved.

But the dominant mood is less panic, more bliss. The loudest reaction is basically: why is this so satisfying? One commenter called it “oddly satisfying,” which feels like the understatement of the century. The clip hits that same brain-scratching sweet spot as domino videos, power-washing clips, and neatly packed lunchboxes—except this time it’s just numbers getting their lives together.

The mini-drama comes from the makers and tinkerers in the crowd. One inspired viewer even dropped a link to their own version made a year later, then casually opened the nerd debate of the century: what even counts as a single step? Is swapping two items one move, or several? That turned a simple visualizer into a comments-section philosophy class. So yes, the video is about sorting—but the comments are about control, beauty, and whether counting the moves is secretly impossible.

Key Points

  • The article features a 2013 video by Timo Bingmann titled "15 sorting algorithms in 6 minutes."
  • The video visualizes and adds sound to the operation of sorting algorithms.
  • It sorts random shuffles of integers.
  • The speed and number of items displayed are adapted to each algorithm’s complexity.
  • The visible description lists algorithms including selection sort, insertion sort, quick sort, merge sort, heap sort, radix sort (LSD), radix sort (MSD), and std::sort.

Hottest takes

"frighteningly deterministic" — formvoltron
"oddly satisfying" — raffael_de
"Is a swap 1 step... or 4" — greggman65
Made with <3 by @siedrix and @shesho from CDMX. Powered by Forge&Hive.