Visualization of 24 Sorting Algorithms In 2 Minutes

Показать описание

Visualization of 24 different sorting algorithms:
- Selection Sort
- Insertion Sort
- Binary Insertion Sort
- Merge Sort
- Quick Sort (LR ptrs)
- Quick Sort (LL ptrs)
- Quick Sort (ternary, LR ptrs)
- Quick Sort (ternary, LL ptrs)
- Quick Sort (dual pivot)
- Bubble Sort
- Cocktail Shaker Sort
- Gnome Sort
- Comb Sort
- Shell Sort
- Heap Sort
- Smooth Sort
- Odd-Even Sort
- Bitonic Sort
- Cycle Sort
- Radix Sort (LSD)
- Radix Sort (MSD)
- std::sort (gcc)
- Tim Sort
- Block Merge Sort (WikiSort)

Similar videos:

More information on the "Sound of Sorting" at

Рекомендации по теме

Комментарии

I find your lack of bogosort disturbing.

jonathanharsh

Come on Cycle, get it together. You've already sorted the array. Even Selection managed to finish before you've checked every.single.element.

JerusalemStrayCat

wow, odd-even sort was even worse than bubble sort

nstyle

For a solid 10 seconds I genuinely thought that the music was just the sound of the sorting

eukarya_

1 - Radix Sort (LSD)
2 - Radix Sort (MSD)
3 - Quick Sort (dual pivot)
4 - Quick Sort (ternary, LR ptrs)
5 - Quick Sort (LR ptrs)
6 - Quick Sort (LL ptrs)
7 - Quick Sort (ternary, LL ptrs)
8 - Tim Sort
9 - Shell Sort
10 - std::sort (gcc)
11 - Merge Sort
12 - Smooth Sort
13 - Block Merge Sort
14 - Comb Sort
15 - Bitonic Sort
16 - Heap Sort
17 - Binary Insertion Sort
18 - Insertion Sort
19 - Selection Sort
20 - Cocktail Shaker Sort
21 - Gnome Sort
22 - Cycle Sort
23 - Bubble Sort
24 - Odd-Even Sort

From fastest to slowest, taken from the point that the code knew it was sorted (and not from the point that it was actually sorted)

SgtAbramovich

Radix (LSD) sort is the kids that can finish the exam before everyone else and somehow get a perfect grade.

The Cycle sort is the kids that already answers every question but keep checking the answers back and forth until the time is up.

And Bogo sort is the kids that just pick random answers and hope they get the right answers.

mythicaldragon

wow, this slow few-element simultaneous comparison really helps to understand how it works, thanks for your work!

ParkSnoopy

Radix sort (lsd) is like "omae wa mou shindeiru"

dynamicgecko

*[Quick Sort]:* "I'm fast as fuck, boiiii!"
*[Radix LSD]:* "Hold my beer . . ."

Intrafacial

Anybody else looking at cycle and thinking

YOU'RE ALREADY SOLVED YOU DONT HAVE TO CHECK LITERALLY EVERY SINGLE ELEMENT!!!

nubscrub

Ahh, get that music out of here!
The real music comes from the sorting.

joseph_arrow

I love LSD it is just great and quick and satisfying

OnumLCT

Radix sort LSD was the clear winner, finishing at a mere 13 seconds in! Second place was Radix sort MSD, which finished 17 seconds. 3rd was quick sort read desc (I cant read what the text says, it’s too small) with 18 seconds. Last place was odd-even sort, which was unable to beat bubble sort.

thomasgamer

Friends don't let friends use bubble sort

ryanzarmbinski

sorry if this comment seems random but here is how every algorithm placed

1st - Probably your best bet - Radix Sort (LSD) 0:12
2nd - Radix Sort (MSD) 0:16
3rd - Quick Sort (dual pivot) 0:18
4th - Quick Sort (ternary, LR ptrs) 0:18
5th - Quick Sort (LR ptrs) 0:21
6th - Quick Sort (LL ptrs) 0:22 - 0:23
7th - Quick Sort (ternary, LL ptrs) 0:24
8th - Tim Sort 0:25
9th - Shell Sort 0:26
10th - std::sort (gcc) 0:26
11th - Merge Sort 0:27
12th - Smooth Sort 0:38
13th - Block Merge Sort (WikiSort) 0:39
14th - Comb Sort 0:40
15th - Bitonic Sort 0:43
16th - Heap Sort 0:43
17th - Binary Insertion Sort 0:51 - 0:52
18th - Insertion Sort 1:01
19th - Selection Sort 1:19
20th - Cocktail Shaker Sort 1:23
21st - Gnome Sort 1:44
22nd - Cycle Sort 1:53
23rd - Bubble Sort 2:00
24th - Probably shouldn't ever use - Odd-Even Sort 2:03

gcls