20 Sorting Algorithms Visualized - Scatter

Visualization of 20 different Sorts as a scatter plot with sound.

Time Stamps:
00:00 Quick Sort (Dual Pivot)
00:45 Tim Sort
01:40 Shell Sort
02:17 Bubble Sort
03:40 Insertion Sort
04:20 Merge Sort
05:03 Double Selection Sort
05:18 Heap Sort
06:03 Cocktail Shaker Sort
07:27 Gravity (Bead) Sort
08:00 Radix Sort Base 10
08:27 Gnome Sort
11:42 Cycle Sort
12:10 Selection Sort
12:35 Bucket Sort
12:50 Quick Sort (Pivot Middle)
13:10 Comb Sort
14:39 Counting Sort
15:00 Odd Even Sort
16:20 American Flag Sort
16:50 Comparison Table

Measurements explained:
As "Comparison" counts the comparison of a value from the Array with any other value.
As "Segment" counts every sorted part of the array.
"Real Time" corresponds to the measured time only used for the algorithm.
As "Swap" counts the exchange between the indexes of two elements of the array.
As "Write to the Main Array" counts the change of a value in the Array.

Please put your wishes and questions in the comments. :)

▬▬ My Equipment ▬▬▬▬▬▬▬▬▬▬▬▬▬

* The links marked with an asterisk (*) are affiliate links. If you click on such a link and make a purchase, I receive a commission from the respective online shop or provider. The price for you does not change.

[caseyelworthy]

Bubble Sort, Cocktail Shaker Sort, Gravity Sort, and Odd Even Sort were particularly beautiful! It felt like I was watching some kind of Virtual Boy art

[donkanator]

Ok, that's the weirdest thing I watched. If my wife saw me I would have a lot of explaining to do

[frantzf]

Found you on reddit, keep it up! Cool stuff 🤓

[Fex.]

Double Selection wins! 14, 18ms with no Aux writes and very reasonable 2 * <element amount> writes!

[ThemGrayJackel]

I like watching these because I get to see new types of sorting methods.

[CompilerStuck]

Hey, if you like the video consider to leave a like, and subscribe if you want to see more! :)

[Obstagoon]

6:59 The portal is closing! Better hurry!

[brunocalhau]

Hi, excellent video, the animation are hypnotic ;-).

But i think there is a a problem with the double selection sort algorithm show case.
Because it runs too much fast, and there is no reason for that. Only explanation see, is if write operations are considered by far more cost effective than comparaison operation.
For instance double selection sort make 923k comparaison + 3, 8k writes --> 926, 8k op in 14ms, but heap sort, make 40k compares and 38k writes--> 78k op in 49ms for me it doesn't make sense as we have 10x less operations in total.

BTW Great video :-D

[blablafoof]

Woah bubble sort looked like a moving texture.

[saurabhsswami]

I really like it! Wish it was a shorter video tho

[Explosiv]

I feel like the name Cocktail Shaker Sort fits well for the graphic

[arleyhenostroza]

I don't know now what algorithm use to sort the times, I need to know which one was faster

[NeuQN]

Which one was the fastest? Double selection sort?

[bum]

"Cocktail shaker", more like "tear in the fabric of reality healing"

[wnoise]

Can you redo this, using proper decimal and thousands separators? Numbers, like sentences, should have one period, and as many commas as necessary.