ฝัง
- เผยแพร่เมื่อ 28 ก.ย. 2024
- I finally revamped the "Run All Sorts" button in w0rthy's program, so here are some new sorts while we're at it! Please let me know if any part of this video is hard on the eyes. I thought it was safe to remove the "Seizure Warning" tag from the title, but I always could be wrong!
Check out the program here: github.com/Mus...
Visit the channel Discord here: / discord
Check out the Mother 1+2 Restoration project: / discord
Uh... Uh... quicksort are you okay?
Quicksort - especially with a naive choice of pivot - is notoriously NOT quick when the input is already sorted. There are ways to avoid the pathological cases, but MC is clearly not doing them here.
I'm demonstrating many different pivot selections throughout the video!
Yeah I think quicksort needs therapy
“Quicksort, go home, you’re drunk”
It looks like it is selecting the right end as pivot, which is the largest, since it gets slowly closer to the left.
(Worst case scenario)
It seems to always make sense to do an "is this sorted" check before anything else since it is trivially fast
I agree, in the correct notation that check is O(N), means as there are twice as many elements it takes twice the time, fun fact: radix sort and counting sort are also O(N)
@@rogervanbommel1086 Correct me if I'm wrong, but isn't radix sort O(N * log(R, base=B)) where R is the range of the array and B is the base?
_fluffyy that might be right, but the important thing is that there is no N log N or N*N term, big o drops smaller terms
It is so extremely rare to sort something of at least a few hundred numbers that is already sorted... it overall doesn't really matter, since they are so fast.
@@rogervanbommel1086counting sort is O(n+k) when k is the number range
18:10 Iterative Bitonic Sort is my jam!
0:58 quicksort is confused
LL "Quick"sort apparrenly SUCKS on non-completly-random arrays
Stable quick sort: bruh
Yeah, it's an O(n^2) sort that pretends to be O(n log n).
Heapsort: I use the heap property to sort the array
Heapsort when the array is already sorted: I use the hammer to sort the array
Heapsort (Min + Max + Weak + Ternary + Smooth + Poplar): Are these sorted?
Sorted
i swear l/l quick sort sucks so bad compared to the others
Bogo sort is
seems april fools came late this year
(jk, but still)
Quicksort, or: Much Ado About Nothing
There was no need for the "shuffling" animation.
Fair enough.
Classic Bogo Sort: At last, I have found something I'm good at.
All the heap sorts (except min) did ALL those comparisons to put the list pack the *same* way it found it
I'm a little confused - if the delay is 1 ms, then how is there a decimal sort time?
The sort time is the estimate of how long it would take if the delay wasn't there. It's the amount of time that the program is doing things other than waiting or drawing the screen.
Exactly what Felthry said!
It's quite evident all of the algorithms that actually do an "is this sorted alrleady?" test. I find it funny that not all sorts do that, since it only gives you a +n on the time complexity. So for Quicksort, the average time complexity would become O(n (1+log n)), but the best would become O(n). And that's only O(n) on the reading time complexity. If it's already sorted, the writing time complexity would drop to O(0).
Well actually... technically, if the writing time is the same for 2k numbers as it is for 16k numbers, then it's considered constant -- O(1).
Ok??@@Musicombo
Quick sort really out shining the competition here
Weave merge sort.exe has stopped working
Hello
I love how IP radix LSD base 10 sounds similar to how it usually does, but not quite as chaotic
Square root Sort is disconnected
This is the fastest collection ever I have seen!!!!!
Perfect 🤩
Wait…
I was wrong 😨
Quicksort and Mergesort is so long that it take over 1 minute
Bad at here 😂
Edit: Wrong grammar lol
Can you make a oscilation of arrayV
Im meaning the sound
11:38
11:38
11:38
11:38
11:38
11:38