20+ Sorting Algorithms Visualized - Disparity Chords (Reversed Inputs)

A Compilation of Sorting Algorithms handling reversed inputs - visualized with Disparity Chords
Any ideas for interesting visuals? - tell me in the comments
Featured algorithms:
00:00 Radix Sort
00:11 Merge Sort
00:31 Tim Sort
00:56 Gravity Sort
01:02 Odd Even Sort
01:40 Bubble Sort
01:50 Shell Sort
02:11 Shaker Sort
02:23 Heap Sort
02:42 Comb Sort
02:55 Gnome Sort
03:34 Cycle Sort
03:46 Counting Sort
03:56 Selection Sort
04:10 Double Selection Sort
04:19 Insertion Sort
04:32 Bucket Sort
04:39 Pigeonhole Sort
04:47 American Flag Sort
05:00 Quick Sort (Middle Pivot)
05:05 Quick Sort (Dual Pivot)
05:13 Bogo Sort

[@dragoncaretaker94]

8 bit sound effects!
5:13 - preparing welding torch
5:14 - using welding torch

[@fletchqc9900]

odd even sort casually having a seizure

[@Donu_tLover]

take alook at shaker sort

[@Wmafateh]

0:58 my favorite sort

[@user-xy5yg6se1k]

how does it take that many tries for bogo to sort 12 elements???

[@CompilerStuck]

Bogo Sort is not really a sorting algorithm. It shuffles the elements randomly, until they are in the right order

[@sunanimatons]

it takes 12 factorial tries on average, that number is 479001600

[@algodoomarbleracing]

@@CompilerStuckit’s a joke sorting algorithm (they don’t sort jokes, but they are jokes)

[@rsyvbh]

It randomises every time and there are 12! permutations, so approximately 12! tries, so approximately 479001600

[@m_affiliates]

@@algodoomarbleracingI get that reference

[@twixerclawford]

Shell sort was an absolute bop

[@GelatinousSSnake]

Quicksort sure lives up to its name

[@alejandraquinteros6508]

ABCDEFGHIJKLMNOPRŠZŽTUVWÕÄÖÜXY

[@akivabamberger7145]

i am liking your sorting concepts a lot... wonder if there's a way to use a different synth for the sound

[@alejandraquinteros6508]

ABCDEFGHIJKLMNOPQRŠZŽTUVWÕÄÖÜXY

[@mariasuazo3320]

I commented this in my grandma's phone.

[@JJVUltima]

brain happy ❤

[@Jirehsecondchannel]

1:54 my favorite sort

[@unrellated]

My suggestion for a visualizer is to take that cube visualizer, and give each element a color based on it's 3D position in the fully sorted cube. Each axis will determine the red, green, and blue components of the color.

[@alejandraquinteros6508]

aáàâãäåæāăąª

[@alejandraquinteros6508]

bɓ

[@alejandraquinteros6508]

dðďđɗḍ

[@alejandraquinteros6508]

eéèêëēėęěĕəẹ

[@alejandraquinteros6508]

f

[@Dancetothetower]

radix sort is a nonagon infinity fan i see

[@chrisrodriguezm13]

It’s base 10, so it’s a “decagon infinity fan”

[@endersoncorrea8659]

0:15
0:39
1:01
1:50
2:32
3:26

[@user-xt2gu4mt9k]

Gravity sort looks a satisfying sort.

[@chrisrodriguezm13]

Comb sort is like shell sort but the shell is distracted and puts random waves everywhere, for me

[@alejandraquinteros6508]

AÁÀÂÃÄÅÆĀĂĄª

[@alejandraquinteros6508]

BƁ

[@chrisrodriguezm13]

@@alejandraquinteros6508 Do you have a stroke

[@alejandraquinteros6508]

OØÖÕÔÒÓºỌŒŐŌ

[@alejandraquinteros6508]

P

[@Andrew-jh2bn]

I don't understand... Timsort on a reversed input is supposed to just reverse the data back in a single step. Is something wrong here?

[@CompilerStuck]

Tim Sort uses a 'run' variable, typically between 32-64, to identify segments and sort them via insertion sort or reverse them if needed. Kuvina Saydaki illustrates this in his video ua-cam.com/video/FntVy6lPVyo/v-deo.htmlsi=X_Esad9SI-wV3mOH&t=435
In my code, I set the value to 32, causing that pattern in the first half of the process ( 00:31 ) After this, merge sort takes over

[@Andrew-jh2bn]

@@CompilerStuck sounds like you're referring to the "minimum run length", where if a small run is shorter than this threshold it uses insertion sort to create a run at least that long before it moves on to merge sort. The algorithm should still detect a reversed array as a single run and flip it, however, as the whole point is detecting already sorted data as much as possible.

[@CompilerStuck]

@@Andrew-jh2bn I basically used this implementation: github.com/argonautica/sorting-algorithms/blob/master/Java/TimSort.java

[@Andrew-jh2bn]

@@CompilerStuck ah, okay. This implementation is wrong then. It doesn't even attempt to find "natural runs", so it isn't Tim sort. It's just selection sort, then merge sort.

[@CompilerStuck]

@@Andrew-jh2bn thanks for finding that, i'll look into it :)

[@user-xy5yg6se1k]

0:57 why am i laughing?

[@Unlimit-729]

LOL

[@Unlimit-729]

Please🙏 how do you creating this videos?

[@endersoncorrea8659]

3:41
4:13
5:00
👇🏼😁

[@user-xt2gu4mt9k]

Bogo sort is 12 numbers and elements.

[@mitchkiggins9661]

whats tim sort?

[@numberblocksminecraft]

Gnome sort fast lol

[@endersoncorrea8659]

1:00
2:35

[@user-xt2gu4mt9k]

Radix LSD sort is base 10, but...

[@Osmone_Everony]

Gravity sort at 0:56.

[@user-xt2gu4mt9k]

I think Bogo sort is the too much fastest.

[@user-xt2gu4mt9k]

20 sorts have no verify sorts.

[@Markty07]

Forgot stalin sort

[@alejandraquinteros6508]

b

[@alejandraquinteros6508]

d

[@alejandraquinteros6508]

f

[@alejandraquinteros6508]

i

[@alejandraquinteros6508]

j

[@Scratchydoesmusic]

Oeurrrrrrrrrrrrrr

[@AndraesPasset]

watch at 2X speed