Radix Sort (LSD)

Visualization and "audibilization" of the LSD Radix Sort algorithm.
Sorts a random shuffle of the integers [1,100] using least significant digit radix sort with 2-bit radixes (4 buckets). The algorithm sorts out-of-place: it copies elements to a shadow array during the counting sweep. As radix sort is not comparison-based, in this audibilization each item access yields a sound.

[Freez.T]

This is favorite dealer's music! The Dealer love this song!

[markeevch]

Dealer, when my audiosystems in his possession.

[longfork]

"Yo pass me the aux cord"
"You better not play trash"
Me: Radix LSD Sort Base 10

[erikdahl]

Man, this sharp-toothed meatball sure knows his stuff.

[TheGlowingBeansGuy]

Never pass the Aux to the Buckshot Dealer bruh.

[R_ylee]

Of course the Dealer is into this kind of thing...

[KingThrillgore]

It's impressive you can write a sorting algorithm without ever needing to do a single comparison operation.

[Borislovefei]

I've listened to all of them and this is by far my favourite. Those last few seconds :o

[erni_fx]

We making it out of ̴̭͆͝Ó̷̪̘̣̏͛R̵̾̕ͅ with this one 🔥🔥🔥🔥🔥🔥🔥🔥🔥

[moth.monster]

Is this what being on LSD sounds like?

[chotic]

apperantly this is dealer's favorite song. Good to know

[unkinown]

This is canonically dealers' fav song now

[griff]

Little known fact, this sound is playing constantly in my head.

[urbanstahel]

Contacting mothership; Uploading data...

[marquizzo]

Fascinating seeing the 2-bit system come into play:

Notice after the first pass, at 0:08, each ordered row is divided into groups of 4 integers (2 bits), which is hard to distinguish.

After the second pass, at 0:15, you can start distinguishing ordered rows divided into groups of 16 integers (4 bits).

After the third pass, at 0:22, you can clearly see the lower ordered row of 64 integers (6 bits), the higher row being the remaining 36.

[hlebushek]

yeah, i can uderstand why dealer likes it

[xygomorphic]

Fun trivia: IBM built a machine that could physically sort punch cards, and it worked pretty the same way this algorithm does. The holes punched in the card would correspond to its number, and the machine would read the punched hole and depending on which number it stood for, would drop the card into one of several "buckets". Doing this over and over, it could sort up to 450 cards per minute, which was an amazing accomplishment for 1925.

[Jadinandrews]

I love how these audible algorythms sound like the robots from 60's sci-fi movies.

[The-pfzy]

Really amazing sort. It's my favorite!

[laharlk]

I love how this one sounds with bigger arrays :P