ฝัง
- เผยแพร่เมื่อ 1 เม.ย. 2021
- Visit our community Discord here: / discord
Check out the NEW home for ArrayV here: github.com/gaming32/ArrayV-v4.0
Check out the Mother 1+2 Restoration project: / discord
Thank you to Kalmar Republic and Segaking584 for supporting my videos!
Join this channel to get access to perks:
/ @musicombo - วิทยาศาสตร์และเทคโนโลยี
Visit our community Discord here: discord.com/invite/2xGkKC2
Check out the NEW home for ArrayV here: github.com/gaming32/ArrayV-v4.0
9:29 magic moment
always takes 12288 writes to both arrays as radix sort has a fixed run time for a given data set of O(N*B) where B is the base of the number such as 4 base in this example and N is the amount of data if I understand it correctly.
I’ve noticed that the last two steps always look the same.
except bell curve array, perlin noise curve and perlin nise
@@hydrate6913 they do the same operation though
That’s how LSD Radix Sort works: Everything that has the same number in a specific placement (like 10s, 100s, etc.) gets put in the same spot and repeat for the next digit placement up until the whole thing is sorted. By the time it gets to the last digit placements those pretty much the rest of the placements have already been sorted.
The last step also sounds like a microwave :P
Who will tell him how radix sort works? Because it wont be me.
5:28 ? 👁️👄👁️
that's not specifically lsd sort base 4, and also i'm pretty sure lsd sort would sort an already sorted array
if you wanted to have it sort this correctly, then youd have to add additional checks to put it in the correct base, partitions, and what number in each number it has to compare. this could potentially take more time on average than just sorting it regardless because theres so much to figure out
10:53 sounds like "WOOOOW!"
10:55
Cool
Soundfront:LSD Acid
Do base-2
Bro I want to ask why don't we just use the base as n?
You could, but then that basically becomes counting sort!
@@Musicombo Thanks for the information!
@@RedstoneNguyen Oh, I should qualify this: Radixsort base n is basically counting sort *assuming a linear distribution*.
@@Musicombo I don't quite understand, but that could be nice to be in the description :)
@@RedstoneNguyen generally radix LSD sort is kinda modified counting sort
Why does it always take 22 seconds?
Because the runtime is defined by the size of the array. It's always the same size so it always takes the same time.
That's it's big advantage. The larger the array, the faster it is compared to other algorithms.
If you have insanely large arrays, it takes a fraction of the time of any other sorting algorithm
The smaller the array, the more is the advantage eaten away by its overhead. So fastest speed but largest overhead, so only worth using if the array is large enough
@@shirakawamaseru hmm I guess that makes sense
I'm going to give a different answer: it always takes the same amount of time, because there are no comparisons. No comparisons means no decisions can be made about how things should be most efficiently done. Therefore, it can only be done one way: the slow way, the whole way, every time.
Why is bro testing so many shapes? Radix sort is guaranted to perform the same (even if it is sorted lol)
Sort cooler!
I can’t see those It burned my eyes.
3:14
And super burned my eyes too.
3:43
OH MY GOD
IT BURNS MY EYES!
4:14
4:43
*dies*
@@MoeXBlackybruh
😂😂😂@@JakeKartaBAWER127-October
why did you claim a sorting algorithm video tho?
???
I’m Late Again In Live Chat,
A