Stooge Sort

Visualization and "audibilization" of the Stooge Sort algorithm.
Sorts a random shuffle of the integers [1,64] using Stooge sort. It uses the implementation from en.wikipedia.or... .
More information on the "Sound of Sorting" at panthema.net/20...

[@GLITCH_-.-]

Looks like the algorithm didn't really trust itself very much...

[@live22morrow]

Consider that it performs around 18,000 comparisons after the array is already sorted.

[@philiphunt-bull5817]

_efficiency_

[@ouch9841]

[ Alzheimer's ]

[@californium-2526]

Efficiency -9%

[@dnaroseandthewolves]

recursion

[@morgansaville8508]

"Hmmm I wonder if the data moved around while I wasn't looking... better go back and check!"

[@zlodevil426]

No. Stooge sort works like this: sort the first 2 thirds, then the last 2 thirds, then the first 2 thirds again. Each part is sorted using stooge sort too

[@fuyumi4309]

@@zlodevil426 it was a joke

[@zlodevil426]

@@fuyumi4309 i knew that it probably was, I just wanted to explain how it really works

[@txqea9817]

why have free time when you can spend ten hours watching a computer sort data in a terribly inefficient way

[@firstnameiskowitz8493]

hey quiplash, wanna see me sort?

[@clyde-or-monty]

bogo sort:

[@Roxor128]

This is what bored programmers come up with to pass the time: Comedy in code form.

[@jakethewolfie119]

Codedy.

[@KingJellyfishII]

Step 1: look at a few integers Step 2: look at them again just to check they haven't magically become something else. Step 3: repeat step 1 & 2 a few times. Step 4: sort them Step 5: move on to a different set of integers Or Step 1: look at some values Step 2: check they haven't changed Step 3: ??? Step 4: profit

[@smaybius]

Not sure if this is a joke, but stooge sort works by working on the first 2/3, then the last 2/3, then the first 2/3 again, and recursively breaks each of those 2/3 down into those three 2/3 until they're the smallest size. Udiprod has a much better explanation, and the only reason why that video is almost an hour long is because of bogo sort trying to finish the race

[@rynabuns]

2:31 Uh? It's done! Hello…? Helloooooooooo

[@honchokomodo]

+Ryna Lau the algorithm is just really stupid

[@andrasfogarasi5014]

It's just making sure.

[@rich1051414]

@@andrasfogarasi5014 And then it needs to make sure it is sure.

[@ZeldaACFan17]

@@rich1051414 Then make double sure it's sure, and then triple, then quadruple...

[@NoriMori1992]

@@andrasfogarasi5014 Sounds like my ADHD.

[@Kabitu1]

This really gives you an appreciation of what O(n^2) really means; in terms of a problem that can be solved in linearithmic time it means fucking around being useless all day long.

[@leopoldslikk3121]

O(n^2) indicates complexity, not how smart an algorithm is.

[@roguepackets2198]

I'm pretty sure you mean "T(n^2)".

[@Kabitu1]

Rogue Packets No, I meant the time complexity is O(n^2). Is that wrong?

[@roguepackets2198]

Kabitu1 Ah. Sorry. Turns out T(blahblahblah) is worst-case time.

[@trissylegs]

Kabitu1 Stooge sort is actually O(n^(log 3 / log 1.5)), about O(n^2.7095)

[@Richardddoobies]

It seems to tickle groups of integers a few times before deciding to move them.

[@prim16]

This shouldn't have given me a hard-on.

[@user-mp8oo6de2i]

saw this comment on another sorting video HM

[@want-diversecontent3887]

Rick Davidson "Sort 2/3, sort the second 2/3…did I sort the first 2/3 already?"

[@TheF4talgamer]

@@want-diversecontent3887 how can you sort a second 2/3 if you only have 1/3 left

[@want-diversecontent3887]

Just a Random Name Alright, so let's say we have 3 items like this: 3 2 1 Sort the first 2/3 2 3 1 Sort the second 2/3 2 1 3 Sort the first 2/3 1 2 3

[@dorukayhanwastaken]

Is this algorithm made to show how not to use recursion?

[@rich1051414]

Yes. It is called 'stooge sort' for a reason. It sums up what you shouldn't do. Mainly, redundant operations.

[@pvic6959]

@@rich1051414 shoot ive been using this sort for my very time sensitive stuff!

[@LieseFury]

@@pvic6959 try bogo sort instead

[@pvic6959]

@@LieseFury oh yeah I switched to that a few months ago!

[@Exarian]

"congratulations, you've successfully given a computer anxiety."

[@jacquelineamelie5467]

*is sorted for 20 seconds before it decides its actually sorted*

[@lpsp442]

Love the peculiar looping sound this overly-cautious algorithm produces

[@hymnodyhands]

It reminds me of the song "Tumbling Tumbleweeds" ... one can hear the wind, and the tumbling ...

[@michaelhubertz3016]

This is a _musical_ algorithm, useable for sorting purposes. Just needs some extra time before it stops. Reminds me of Beethoven's Schlussproblem...

[@nuniezjorge]

this algorithm was actually created by the 3 stooges by accident

[@DeViLTh0rn]

nuniezjorge good one 😂😂😂

[@epsilonthedragon1249]

If bubble sort is faster than you by a long shot, then something is horribly wrong.

[@SassInYourClass]

2:30 What are you doing? It's already sorted!

[@ado3247]

it is checking if the elements havent moved themselves

[@dnaroseandthewolves]

Stop!! He's already sorted!!

[@radovanbabjak7903]

Somebody made this algorithm Looked at how long it takes to sort this little array *4 years, perfect*

[@FabbrizioPlays]

If Slow Sort is just a paranoid merge sort, then Stooge Sort is a paranoid bubble sort.

[@theplayer12312]

its a paranoid gnome sort

[@Konym]

The algorithm just decides to have a seizure for like the past half minute or so while the integers are already sorted.

[@beatlestaute221]

When she says “ just to be sure” 2:30

[@leandroaraujo4201]

3 secs later - Oh, did I make sure everything was fine? Meh, just in case.

[@tansly5001]

the most musical sorting algorithm i have ever seen

[@wawawa-u8f]

i thought the same too lmao

[@KingJellyfishII]

You know you're board when a sorting algorithm makes you laugh

[@myrjavi]

Hi! I’m chalk

[@dnaroseandthewolves]

Yo, I'm marker

[@clyde-or-monty]

eyyy im the eraser wassup

[@vitakyo982]

It's safer to check several times

[@epickittystudios1041]

THE SLOWEST SORT I HAVE EVER SEEN... other than slow sort (obviously)

[@Frabjous1]

I suppose you haven't seen Bogosort or Bogobogosort.

[@aaronvxblu215]

Or bozo sort.

[@PandoraSystem]

Frabjous bogobogosort? How do you recurse total randomness?

[@exedeath]

1-x=1 2-Sort the first number by randomness. 3-go to 6 4-x=x+1 5-Sort the first x numbers by radomness. 6-If there are more numbers at the list go to 4, if not go to 7 7-The list is sorted.

[@theAmazingJunkman]

bogosort is not a sorting algorithm. its a meme.

[@derpboi3155]

Stooge sort: an insecure algorithm that checks its work every other second to make sure it hasn’t rearranged itself.

[@therealelement75]

Ok let's check the first ⅔ That part's solved Now the last ⅔ It's already solved yay Wait let's check the first ⅔ because why not And each 2/3 is sorted with Stooge Sort. 【Efficiency -67%】

[@gravelstudios]

Stooge sort is my favorite sorting algorithm, because unlike most of the other "bad" sorts, Stooge sort is the type of thing you could imagine a freshman comp sci major coming up with and thinking it's very clever, and being proud of it. Let's face it, we've all written our own Stooge sort at some point when we didn't know any better.

[@Erunaamo]

Flight of the Bumblebee

[@TarigonTetradactyl]

the stooge sort has a strange phobia that the subjects moved themselves while it asnt looking

[@prohacker5086]

the algorithm is a little nervous i guess?

[@KingJellyfishII]

Paranoid that the array will change behind its back

[@TarigonTetradactyl]

trust noone

[@philiphunt-bull5817]

Not even yourself.

[@zelikris]

Troll Sort

[@KasranFox]

zelikris nah, that's bogo sort.

[@chase_like_the_bank]

+Kasran Fox nah because this one actually functions, and someone who didn't know better might accidentally use it. Nobody is going to accidentally bogosort their data.

[@KasranFox]

chasenallimcam Fair enough, haha.

[@kristiansims]

+hal But if someone did bogosort their data, it would be, by definition, accidental.

[@Al93271]

Did you call it troll sort because at the end it checks it even though it doesn't need to and spends like 20 secs doing so?

[@TarigonTetradactyl]

"ok lets moves this he- wait i gotta check if the others moved anywhere"

[@RainbowManification]

ADHD sort

[@RoadkillD418]

I have severe OCD *and* severe ADHD. This is what my brain looks like.

[@bunbunnbunnybun]

Sure

[@NoriMori1992]

Same, even with just ADHD my brain is basically exactly like this.

[@ouch9841]

Alzheimer's.

[@happypiano4810]

@@NoriMori1992 Nah. ADHD alone doesn’t do this much recursion. We have BOGOsort.

[@lunardoesmusic]

It sounds so indecisive.

[@melodiquest]

Absolutely love the sound of this one.

[@DaemonWorx]

Stooge Sort: Bubble Sort on a sugar high with a general anxiety disorder

[@mauricestardddude8317]

"I am not really sure... better check again"

[@rich1051414]

I find this sorting algorithm kind of endearing. Reminds me of pets I have had.

[@vibronik]

it sounds like crazy ass video game dungeon music. Like if Koji Kondo went insane

[@eaglelord145]

I didn't think I'd ever see a sorting algorithm with anxiety

[@FlaxTheSeedOne]

Okey this is like a slowsort with even a bigger amount of paranoia of elements moving

[@PaxeM]

I listen this as a musician, and it's very interesting... I don't care about efficiency ! 🙂🙃

[@andrasfogarasi5014]

2:30 *Uh, you can stop now.*

[@leandroaraujo4201]

Nah, just to make sure everything's fine. Lol

[@faizanullahkhan1282]

This is what happened to BubbleSort after years of humiliation

[@charlieferme5274]

*Franticly google searches is it normal to feel emotions to sorting algorithms*

[@inactiv4822]

Me: Bogo, are you fast? Bogo: Yes but actually no

[@Ambipie]

Ive seen the other anxiety sorts. But this is the first anxious sorter that didnt believe it was done. Was this sort invented with a broken server in mind?

[@therealelement75]

It shows how NOT to use recursion It checks the first ⅔ with Stooge Sort, checks the last ⅔ with Stooge Sort, then checks the first ⅔ again with Stooge Sort. So if you give Stooge Sort an already sorted list, it will basically check the first ⅔, check the last ⅔, then checks the first ⅔ for if any magical shuffling happened. It would be slower than Bogosort if both were fed an already solved list. If fed a scrambled list, Bubble Sort would be faster.

[@dlwatib]

Larry, Mo and Curly would be so proud!

[@kmktruthserum9328]

o its u coloring each line in paint... that takes lots of time.

[@Reitenshii]

It's the program that does it...

[@kmktruthserum9328]

yea i think i was high when i commented.

[@mariafe7050]

@@kmktruthserum9328 I love how your reply has more likes than the original comment.

[@therealjammit]

Just slightly better than a bogo sort.

[@inactiv4822]

When bogo sort tries the best

[@tungto2527]

159.367 array accesses @_@

[@zoned7609]

159,367*

[@AidenOcelot]

CaligulaClone some places use decimals in place of commas and vice versa

[@hymnodyhands]

I love that this is Creative Commons ... the musicality here is almost begging for collaboration...

[@mekaindo]

2:24 those swapped elements in the middle of the array waiting for stooge lmao

[@jakerussell135]

Insertion sort but it's paranoid that stuff was moving around when it wasn't looking

[@SuperfieldCrUn]

Stooge Sort first recursively sorts the first 2/3rds of the list, then the second 2/3rds, then the first 2/3rds again. The first pass ensures that the largest values are in range of the second pass to place in correct order, then the third pass sorts what's left over. You can probably see why this algorithm is so horribly inefficient - while the final third of the list is only given one pass, the first third is given two and the middle third is given three. This results in a lot of wasted work as it sorts and resorts parts that have already been sorted and times where any real swaps are made are rare - and the recursion means that this redundancy will be multiplied again and again. A slight optimization can be made where, if the second pass does not result in any swaps, then the third pass can be skipped. However, the sheer amount of redundant work done with this algorithm regardless of optimization cements it as a thought experiment and not something that has any practical purpose. That said, it is at least easy to implement: if the list is size 2, then swap if out of order; otherwise, calculate pass size (2/3rds of sub-list size, rounding up) and recursively call itself three times using the proper positions based on the pass size.

[@igneousorgan6435]

Watching this made me think about dementia.

[@Ambipie]

Both it and Slow Sort behave like an antivirus. "Did something go wrong while I was over here?" Like a librarian checking for anything that fell off the shelf

[@samuels1123]

Stooge sort operates assuming the worst possible given order, meaning at least if assuming comparison takes 0 time it would always complete the same list at the same speed

[@ScarletEmber64]

step 1: sort items step 2: sort again just in case step 3: ooone more time step 4: okay juuuuuust in case step 5: once again, you never know step 6: hmm I'm still not surrre step 7: maaaybe juuuust in case step 8: alright that's- oh wait gotta double check step 9: alright ooone more check step 10: alright gonna go through steps 1-9 again juuuuust in case step 11: okay okay just oooooone more time step 12: okay mayyyybe once more step 13: done!

[@jeredLopez]

Stooge sort:scared he might’ve messed up

[@eggyrepublic]

Bogo sort is the master sort

[@TheEnderLeader1]

Get Sheet Music Boss to do a cover of this.

[@64_bit80]

2:31 checking my answers on a test for the 5th time

[@irgendwerausbayern1999]

BubbleSort is better than StoogeSort.

[@billybobjoe198]

Is there a sort method that just look at one bar, then checks the neighbors, and then sorts those, then move on to the next, and then just does that over and over until it's sorted? So, is 0 smaller than 1? Yes? Okay. Is 1 smaller than 2? No, Swap. Is new 2 smaller than 3? Yes? Is 3 smaller than 4? etc etc.

[@bobczech7774]

basically the trash version of circle sort that sorts the before sorted bits first if you look at what the unsorted crap looks like for both

[@zacjacob4349]

2:30 It's finished, you can stop now.

[@SomeDudeInBaltimore]

This looks like it would absolutely trash an SD card doing a direct external sort.

[@andrasfogarasi5014]

Looks like epilepsy.

[@mechanicalsnail4703]

?Why

[@zinderzaz1345]

Literal example of: *ARE YOU SURE!?!?*

[@ScribblePleb]

Code with anxiety. Nice

[@ghostgirl4443]

even the captions think it's music

[@lookadooka_]

I can't explain it but this algorithm has anxiety

[@The-pf4zy]

Looks like Slow Sort.

[@ohgodpleasehelpme4337]

This is what Sorting algorithm with OCD looks like

[@rex9003]

no mercy for stooges

[@teodorb.p.composer]

My faavourite music.

[@oogooro]

this is the most furry sort i've ever seen

[@azertycraftgaming]

Could it be useful for redundant checking like in radiation zones or whatever?

[@nunsense9489]

Better be sure than of not aight?

[@Gamesmarts194]

I'm watching this with x2 speed and it's STILL painfully slow lol

[@darkgalaxy8104]

This is cancer... This is not okay... It's time to stop...

[@getcaughtin4klol752]

"bogo sort is bad" stooge sort:

[@atomicrhino7182]

If this isn’t the most stable sort ever created we need to burn it

[@audreychambers3155]

Stooge sort might not be efficient, but it is relatable.

[@MoolsDogTwoOfficial]

Insertion Sort but with severe undiagnosed OCD

[@wawawa-u8f]

0:03 old arcade background music be like:

[@Peron1-MC]

very dramatic sounding XD

[@okboing]

the least efficient data-oblivious sorting algorithm

[@angeredgoose7552]

hes trying his best ok

[@j6moon15]

.25 speed its like music

[@mistiebluern]

sounds like boss music

[@webx135]

Bogo sort is faster than this.

[@greenzie7099]

No fucking way

[@Obstagoon862]

+WebX Liar, liar, pants on fire!

[@Optim121]

@@greenzie7099 bogosort has the potential to sort an array of any size in one go. Obviously it's the best sort.

[@awawpogi3036]

Yes it is the fastest only if you are the luckiest person in the world

[@TarigonTetradactyl]

you've never seen bogo have you

[@Supernoxus]

Is this algorithm suffering from alzheimers?

[@inactiv4822]

Bogo sort + Slow sort is Stooge sort

[@noticeme6412]

this sort was basically invented to show how NOT to use recursion

[@rlira8072]

This is paranoia in code form

[@FarmYardGaming]

I can sort of see what it's trying... but lmao