Sort by

Newest

Oldest

Popular

Merge, Heap, Quick or Shell: which sort is fastest?
0:56
Thanos Sort explained, then raced against real algorithms
2:55
Odd-Even Sort — What if every comparison happened at the same time?
2:24
Gnome Sort — Its creator literally named it "Stupid Sort" and honestly? That's part of the charm
7:41
Shell Sort — 65 years old and mathematicians still can't figure out the best way to use it
1:46
Heap Sort — O(n log n) GUARANTEED and not a single byte of extra memory
1:59
Stalin Sort — The O(n) algorithm that achieves perfection by ELIMINATING imperfection
0:41
Bogo Sort — 20 MINUTES of pure randomness trying to solve the impossible
20:01
Cycle Sort — Every write is FINAL and no algorithm on Earth uses fewer
6:10
Thanos Sort — The algorithm that would rather DESTROY your data than sort it #algorithms #thanos
1:26
Cocktail Sort — Bubble Sort learned to walk BACKWARDS and it changes everything #algorithms
16:54
Bogo Sort — 1 HOUR to sort | Rainbow O(∞) randomness vs the clock
1:00:01
BOGO SORT | 10 Minute Timer
10:00
Bubble Sort — rainbow colorful classic
0:58
Purple-to-Yellow Gradient Gnome Sort
1:00
Blue-to-Purple-with-Pink Gradient Pancake Sort
3:19
Odd-Even Sort in blue-to-orange gradient
3:23
Cycle Sort visualized in yellow-to-green gradient
4:46