(seizure warning) ArrayV's impractical sorting algorithms
ฝัง
- เผยแพร่เมื่อ 20 ก.ย. 2024
- 1: Fire sort: O(2(n-1)) best, O(n^3) average and worst, O(1) memory, stable
2: Stupid fire sort: O(2(n-1)) best, O(n^4) average and worst, O(1) memory, stable
3: Reflection sort:
4: Bad sort: O(n^2) best, O(n^3) average and worst, O(1) memory, unstable
5 and 6: Stooge sort: O(n^2.71) best average and worst, O(n) memory, stable or unstable
7: Quad stooge sort: O(n^2.58) best average and worst, O(n) memory, stable or unstable
8: Silly sort: O(n^(log n)) best average and worst, O(n) memory, unstable
9: Slow sort: O(n^(log n)) best average and worst, O(n) memory, unstable
10: Snuffle sort: O(n^(log n)) best average and worst, O(n) memory, unstable
11 and 12: Hanoi sort: O(2^n) best average and worst, O(n) memory, stable or unstable
13: Napoleon sort: O(n) best, O(inf) average and worst, O(1) memory, unstable
14: Selection bogo sort:
15: Bubble bogo sort: O(n) best, O(n^3 log n) average, O(inf) worst, O(1) memory, stable
16: Cocktail bogo sort: O(n^2) best, O(n^3) average, O(inf) worst, O(1) memory, unstable
17: Markov sort: O(n) best, o(n * 2^n) average, O(inf) worst, O(1) memory, stable
18: Less bogo sort: O(n^2) best, O(n^3) average, O(inf) worst, O(1) memory, unstable
19: Exchange bogo sort: O(n) best, O(n^3 log n) average, O(inf) worst, O(1) memory, unstable
20: Median quick bogo sort:
21: Quick bogo sort:
22: Merge bogo sort:
23: Smart guess sort:
24: Bozo sort: O(n) best, O(n!) average, O(inf) worst, O(1) memory, unstable
25: Deterministic bogo sort: O(n) best, O(n * n!) average, O(n! ?) worst, O(n) memory, unstable
26: Smart bogo bogo sort:
27: Slice bogo sort:
28: Bogo sort: O(n) best, O(n * n!) average, O(inf) worst, O(1) memory, unstable
29: Optimized guess sort:
30: Random guess sort:
31: Guess sort: O(n^(n+2)) best average and worst, O(n) memory, unknown stability
32: Bogo bogo sort: O(n^2) best, O(n superfactorial n) average, O(inf) worst, O(n^2) memory, unstable
We've at a point in humanity where watching a bunch of colorful lines making beeps and boops and sorting themselves out is the funniest thing ever.
Optimized bogo bogo sort: Bogo bogo sort, Bogo sort is the same corrupted sorts together.
Why do you mean optimized bogo bogo sort?
Because its optimized.
The fact that Stupid Fire Sort exists.
Seeing reflection sort after stupid fire sort makes it seem like a really good algorithm
7:44 Markov sort is gnome sort but the gnome has 1 IQ
Looks like guess/bogo/random grome sort
Bad sort is paranoid something moved while it was gone
It's more like forgetful
@@smaybius ...
@@smaybius 1:14
@@ethanramcel2749 1:18
@@smaybiusfire sort is trash lol
1:13 That one kid when the bell rings for lunch
6:00 My favorite ringtone!
Why am I laughing at Fire sort???
I mean it is laughably bad
@@ToppCuber O(n³) is bad indeed! Not until you see stupid fire... Quartic time complexity for the win /j
owwwwww owwwwww oweww owwww
Because it's stupid
It looks like it doesnt know where to go
Stupid fire sort is like fire sort but it had too much red bull
More like too much beer.
Evolutionsort: Bozosort the list. If the result is more sorted, continue. If the result is less sorted, undo the results and try again.
The reason you have to use Bozosort and not Bogosort is that Bozosort has a 50% chance to improve by 1 point and a 50% chance to harm by 1 point while Bogosort has an infinitesimally small chance to sort the entire list and an infinitesimally large chance to scramble the list entirely. In other words, Bozosort can have its chance of success biased through survivorship to create progression.
It's more like the original bogobogo, which is probably onion bogo but starts over again whenever it shuffles.
But bozosort never sorted the array. I’ve seen this on Timo Bingmann’s sound of sorting.
That’s just exchange Bogo sort
@@Limeappl890How?
@@chrisrodriguezm13 OK NEVERMIND
Bogo Bogo Bogo sort:
Step 1: bogo bogo sort first 2 elements once
Step 2: repeat step one increasing the size of the set you sort by one every time
If, after any step, the array isn't sorted, restart from the beginning
Your satan 100.0, not just 2.0.
Miracle bogo bogo bogo it would use bogo bogo bogo sort untill only two are left unsorted THEN it waits until they somehow sort themselves without doing anything
Recursion Bogo sort:
1. do bogosort.
2. if not sorted, do bogobogosort.
3. if not sorted, do bogobogobogosort.
4. keep adding layers of bogosort until sorted.
it may never sort because the chances of sorting is double-exponentally increasing. anything slower?
@@klaskeyoneThe bogozogozogozogozogo sort:
The same as my bogozo sort, but dumb and if it’s more sorted then it messes it up, it’s an infixolinitesimally small chance for it to sort.
I dont want to
Stooge sort be like: imma check this one more time just to make sure
Bogozo sort:
S1: select a random variable.
S2: selects a number of random variables by the value of the first selected variable.
S3: shuffles the selected variables.
This repeats until the array is sorted.
6:15 Thanks! I will putting this on my ringtone from now on!
Fire sort be groovin
You should see the stupid fire sort
merge shaker sort:
The same as merge sort, but before making the first sorted segment, it shake-sorts the double number of sorted variables.
Bogo bogo sort has gone mad
Especially by now taking up O(n²) memory space
@@smaybiusi call it stup8d bogosort
gangsta until there’s 2 numbers
Gangsta until Bogo Bogo Bogo is a thing.
@@soniasantizolacocinera774Gangsta until Xolection sort exists, or bogozo sort exists.
@@chrisrodriguezm13gangsta until failing an algorithm
@@Rockys-Studio gangsta until Bogozo takes infinity time to finish
@@chrisrodriguezm13 gangsta until finishing in 50 years
Bogo freeze sort:
It shuffles the list, but when a variable is in the correct position, it doesn't move with the shuffling
How it knows? I don't know, but there might already be bogo cycle
@@smaybius first, it adds a solved one on the screen, then, it checks the variables that match, and they get frozen
-Xolection- No, the insertion sort:
STP1: Selects the first 2 variables, then -selection- Wait no, not the selection, but just sorts them.
STP2: STP1, but it selects more variables.
That’s just insertion sort
this sort is 🔥
Almost 66 million comparasons to sort just 128 elements... ouch
Bozo bozo sort:
STP1: Selects a range between 2 random variables, then bozosorts them.
If it’s less sorted, try again.
If it’s more sorted, continues.
Out Of Bounds/Don't Care Sort
Check if Array is sorted
Sort the opposite way using Slow Sort but take five of random variables and Bogo Sort them
If not sorted correctly opposite or not at all be satisfied with the result
stupid fire sort is trying to clean a dirty bathroom in a megamall
Dual bogobogo sort:
Bogosorts the first 2 elements, then it bogosorts the last 2 elements.
Then repeats the same, except the number of elements are getting bigger, also even if it reaches half the amount of all the numbers in the array, then it stops the sort and “less bogosort”s the array, even if it’s not sorted.
Hanoi sorts is making fire ringtones!
Bogo sort: Bogo Bogo sort is a silly corrupted sort. Plz like my comment...👇🥺
00:12:13 my brain during test
00:14:17 my brain when I figure out *one problem*
LOL
quick bozo sort:randomly pick two items and sort them and put it back in place,the check is sorted,repeat if needed.
That’s just my better bozo sort
Does anyone know of support groups for people who keep watching sorting algorithm videos but don't know why?
Why does it take a long time to sort here?
ALMOST corrupted!
Stupid Fire Sort is a JOKE SORT AND FUNNY
WHAT THE -3//
Better bozo sort:
STP1: Select 2 random variables, but swap them if it isn’t sorted.
STP2: Repeat STP1.
That’s exchange bogo sort
@@Limeappl890 Oh… Also bogo would just shuffle, not swap.
@@chrisrodriguezm13 then tell the studio to rename the name then!
@@Limeappl890I don’t have discord, facebook, X nor reddit 💀
Okay then nevermind
WHAT THE -3))
10:15 what exactly is “slice” bogo sort?
Ascension or Decension I assume.
Bog9 bogo sort is so slow I call it Stupud Bogosort
surprisingly, slow sort was the fastest out of all these
quad stooge sort is
5:27
@@hydrate6913Silly sort:
No time to me to laugh at Stupid Fire Sort.
Bad sort averages a much worse O(n²) (on par with cycle sort AFAIK). Only the worst case is cubic (which fire sort, less bogo sort and cocktail bogo sort achieve on average).
Random shuffles are somehow too good of a case for it to be O(n^2). Reflection sort might also be O(n^2) on random. For less and cocktail bogo, all the shuffle/input does is determine how many min items are at their right spot
@@smaybius So bad sort can't even be O(n²) correctly?
@@californium-2526 Plenty of inputs in Musicombo's streams show bad sort being around O(n³). Its best case is O(n²) for the same reason as selection sort
@@smaybius Huh. Weird. I remembered it as an O(n²). Selection sort (constantly) compares an n² amount of times, as it determines the place of the members of the array. Swaps are done whenever the position of the member isn't in the expected place.
The Quantum Bogo Sort went from 12:16 to 14:17.
No, the quantum bogo sort is actually based on the many worlds interpretation, meaning like bogosort with parallel universes where it actually gets sorted, also the other universes where it’s not sorted, then it gets removed along with everything in it.
Safe quantium bogo sort:
Universes are actually auxiliary arrays, if the main "universe" array is not sorted, less bogosort it, else hide all auxiliary "universes" arrays.
Now, how come you made it so small?
The amount of time that would take would be too much
The writer(s) of RunImpracticalSorts decided what lengths each sort should run on. They're called impractical for how unreasonably slow they are, meaning they're too slow to be on the same input length.
Reflection sort should be moved to exchange sorts...
How the heck does firesort work, cant find a paper on it or anything, it kinda looks like stupid insertion sort.
It's an original algorithm by PCBoy games. It's explained in the source code
1:14 (stupid fire sort) at 2x, to see how high you really are
Markov sort looks more like insertion sort
Insertion sort is not impractical, also markov sort is the gnome sort but with a 1 iq gnome
reversed inputs?
14:07
which screen recorder did you use?
GameDVR
@@smaybiushave you done obs yet
I'm watching this at 2x speed
Why?
@@mariasuazo3320i have 10 mins before school
What's fire sort doing? /genuinequestion
PCBoy describes it as a stupified gnome sort
@@smaybius I notice it tends to reverse the array even when it seems perfect. Stupid fire sort appears to have a stroke while attempting to sort.
@@smaybiusThe markov sort is like gnome sort but the gnome has 1 iq
true!
Fire sort: Mein gott, 327.314 ms, 256 numbers.
stupid fire sort: ...
Stupid fire sort is faster than fire sort 🤨
It's not, it's actually sped way, way up to where the delay is a net zero. You can see how much slower it is by seeing the statistics on the left.
@@smaybius I know. But who cares about real time?
Not funny for me with Fire Sort and Stupid Fire Sort. Plz like my comment...
👇
Is there an explanation of how these sorts work?
Fire, stupid fire, reflection, Hanoi, slice bogo, smart bogobogo are explained in the comments in the ".java" files in the ArrayV repo.
Bad sort: Selection sort, but with a forgetful search routine
Stooge sort: udiprod has an explanation (an hour long because of waiting for bogo sort to finish the race)
Quad stooge: Stooge, but works with probably either halves or quarters
Silly and snuffle sort are slow sort but with altered orders of operation
Napoleon: Confusing and unexplained. A bug made it stuck in a Sisyphus loop when two sorted runs are left.
Selection bogo, less bogo, and cocktail bogo are based on selection sort. If the next item is less than the current item, shuffle (less bogo) or do a random swap (selection bogo). Cocktail bogo is less bogo, but based on double selection sort.
Exchange bogo, bubble bogo: Does a random comp-swap if the array isn't sorted. Bubble bogo keeps the comparators together.
Markov: Gnome bogo, meaning moves the next unsorted item in a random direction until it's in the right place
(Median) quick bogo: Median shuffles the array until the the items are in their right halves, then recursively goes from each half. Regular quick bogo does that, but picks a pivot like regular quicksort instead of going for halves.
Merge bogo: Merge sort, but randomly interleaves the two runs until correctly merged
All the guess sorts don't have an explanation
Deterministic bogo doesn't have an adequate explanation, and stable permutation sort is a stable version of it
Bozo: Does a random swap whenever the array isn't sorted
Bogo: Does a random shuffle whenever the array isn't sorted
Bogobogo: Recursively bogosorts each different array size starting from 2 items, but starts over again whenever anything's unsorted
Hanoi Sort has to be the 24th sort. Stable Hanoi Sort has to be the 25th sort.
11:28 this is worse than bogo sort
how does Napoleon Sort work?
I don't know either
Why am I laughing at Stupid Fire sort???
Quartic Time Complexity is laughably bad
1:14 x100000
2006
Give me 50 like comments...
32768 😧
What's the Big O notation for the last sort?
Yes
O( *yes* )
🔛
Touch giuridica 5:64
You meant 6:04?
1:14
1000000000
firy sort
32 sorts is in this video
Firy sort?
No,
Uhhijj