20 Sorting Algorithms Visualized

Visualization of 20 different Sorting Algorithms as a disparity loop with sound.

The disparity Loop visualizes disparity of the Elements. If an element is at its original position, the distance from the center is max. if it is far away from its original index the distance from the center is 0.
Keep in mind that in this example we look at the array as if the beginning and the end is connected. So the distance between the 2nd element and the last is not n-2, but 2. The array is beeing shuffled in reverse.

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

Algorithm Timecodes:
00:02 Radix Sort (Base 10)
00:19 Gravity Sort (Bead)
00:33 Shell Sort
00:58 Merge Sort
01:27 Heap Sort
01:25 Odd Even Sort
02:40 Comb Sort
03:07 Double Selection Sort
03:20 Pigeonhole Sort
04:06 Selection Sort
04:26 Quick Sort (Pivot Middle)
04:34 Quick Sort (Double Pivot)
04:44 Cycle Sort
05:01 American Flag Sort
05:20 Counting Sort
05:35 Bucket Sort
05:46 Cocktail Shaker Sort
06:30 Bubble Sort
07:16 Insertion Sort
08:00 Gnome Sort
09:00 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.

* 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.

[ashermain_]

Radix Base 10 not being absolutely bass boosted is a blessing.

[INTVEAYSLM]

i didnt feed my colors for one millisecond and now they TWEAKIN 💀💀💀💀💀💀😭😭😭😭😭⁉️⁉️⁉️⁉️😂😂😂😂😂

[mhyragaddi]

4:08 Selection Sort
6:31 Bubble Sort
7:16 Insertion Sort

3:08 Double Selection Sort

[gtdmg]

The visual and sound reminds me of worthy.

[MoosesValley]

Awesome work. These visualisations may not help a beginner understand / differentiate the various sorting algorithms, but they sure are interesting and make a lot of sense when you understand the algorithms, have written the code to implement them, etc. eg. The merge sort splitting the array in half over and over and then recombining the chunks recursively. You are proving that even after 70+ years of digital programmable computers, we can still find new and interesting and sometimes better ways to visualise processes and data. Keep up the great work !! +1 LIKE. +1 SUBSCRIBE.

[XD-vdxw]

X: whats 6 + 4?
My brain: 1:31
Me: 47

[bethgerong]

no one: minecraft loading screen creating a new world be like: 1:01

[Musicombo]

This is pretty cool stuff! Is this your app or a fork of w0rthy's with your own improvements?

[Popular]

7:19 me laughing atva cave and realises there is no caves

[abysspegasusgaming]

0:35 I was feeling a bit froggy that Sunday... Must've been a witch that turned me into a newt. I'm all better now though.

[pntyhem]

Very interesting, thank you. Any chance I could get a copy of your spreadsheet? You gathered some wonderful data but I couldn't play with it!

[bonkser]

can the particles go anywhere in the circle they get sorted into

[arcrius]

It seems like Bucket sort at 5:38 was doing what I normally see Pigeonhole sort do in other videos. (Elements equals writes to main array, writes to aux array is 2x elements, and no swaps).

I had no clue what the Pigeonhole sort in this video was doing at 3:22.

[ProTheRobloxer]

Cycle Sort: Who are you?
Double Selection Sort: I’m you, but faster

[Henqee]

I like this so much! I tried to imitate it for my coding practice, but I am having trouble finding the distance between two elements. I could not see to connect the beginning and the end of the array;( If you don't mind, can you tell me how to do that?

[Handles_Are_Bad_Lol]

Why does shuffling take so long when bogosort exists?

[SkibidiSigmaAUTTP]

5:47 hey kid, wanna listen to this beat?