A small seizure warning for this channel Algorithm sorts can be extremely loud, and seizures can be triggered by noises Algorithm sorts can flash a lot, and seizures can be triggered by flashing Be careful, and have a good stay!
Radix is by far my favorite Sort. The absolutely Alien sounds, the way it seems to scroll across the screen, the chaos that suddenly turns into satisfying patterns. Just gorgeous
Oh god it was so satisfying, I read this comment at the start of the video and checked every counter until the 10 million, it was always so close it hurted
I like the OUUUUUUUUUUUUUUUUUUEEEEEEOOOOOOOOOEOEOEOEOEOEOEOEOEOEOEOEOEO at the end and the DUDUDUDUDUUUDUDUDUDUDUDUDUDUDUDUDUDDUDUDUDUDDUDUDUDUDUDDUDUDUUDD at the beggning
LSD Radixsort has gotta be my favourite sort, just because how rugged it is, you can just about throw anything at it and it'll sort it in a respectable amount of time, and every sort takes a almost fixed amount of time, even on the in-place version, and the pre-final pass being sorted is just so satisfying to watch and hear, even if you throw the most bonkers list at it
@@bitonic589but here's the thing, insertion takes longer than than Radix LSD in huge arrays,which is why i think double insertion sort should be more used.
idk why im so obsessed with sorting algorithms especially cuz ik what basis most of them are going by to sort things but 5:15 i like this one it sparks joy
To explain what this sort is doing technically, it's actually startlingly simple: Take the value of the last digit of the element's number and sort them by it. (So for example if something's value is 1485, 5 is its what it sorts by). This digit is called the least significant digit, where the algorithm gets its name from. (LSD) Anyway, next do the same sort for the next digit to the left of each element in each category, or the next least significant digit of the element. Then do the same thing again for the next LSD, (repeating this for each and every number of digits in all the values, in this case four) then the final digit, or the most significant digit (MSD). Doing this will sort the list by its value. The reason why this works is because it's a stable sort: the elements are arranged in sorted form and stay that way between steps within their "categories" often called buckets, of the previous step. That's also why it "sounds" like it's raising in pitch in the final step, because if you think of it in terms of each bucket they're already sorted.
Nope, doesn't have to be that strict! There's a bit of leeway with the definition. Some would argue a sort that doesn't use O(n) extra space can be considered in-place. Note that this doesn't have to be in terms of just arrays! Quicksort uses O(log n) stack space, yet it's universally considered in-place.
what i think radix does is it scans the thing, and repeatedley slices the pieces into 10 little pieces, and i guess this happens so much it gets sorted.
LSD means least signifikant digit. It sorts the array based on only the ones place, then it sorts THAT array based on the tens place and then it sorts it based on the hundreds place and so on. Its always only the ones, tens and hundreds etc places that is considered, not the entire numbers, hence the comparisons counter stays at 0
@@costa-w3k _in-place_ radix sort is what is really slow. If you allow for auxiliary data structures (like a helper array), then radix sort becomes one of the best around, with O(n) runtime.
Radix has a lot of overheads but it's also linear: it actually gets better in terms of efficiency compared to other algorithms with a lot of elements. Radix doesn't have to deal with an exponentially larger and larger number of comparisons to make as the elements increase, because it just checks the value of each one a number of times equal to its digits (in base 4 so each one has the same number of them). Other algorithms slow down a lot from so many elements to compare, but radix actually handles them like a champ because it essentially doesn't do any true "comparisons".
@@Ceafto2007 Base 2 would work similar to base 10 but with 2 buckets instead of 10 (Likely takes more combovers), but I'm not sure if there's a base 1 edition
@@Matheus_Braz here, so basically, it takes it, (i presume) and it makes it into groups, and keeps on dividing it into small pieces, and then grouping them into order, leaving a small grey bit, which is added onto the base, thus sorting it! i hope i helped! tl;dr: it divides alot, then makes it triangle with grey, added to white.
In normal LSD radix, the array is loaded into buckets of the values of the lowest digit, then unloaded back to the array, then rinse and repeat for the next digit up
This sorting algorithm works by looking at a certain digit of every data point each pass, going from smallest to largets (i.e. 1s place, then 10s place, then 100s place, etc.) and sorting them in to n (n being the base used, such as base 10 in this video) "buckets" based on the digit it looks at. once it goes through all the digits, the array is sorted.
Visit our community Discord here: discord.com/invite/2xGkKC2
Check out the NEW home for ArrayV here: github.com/gaming32/ArrayV-v4.0
A small seizure warning for this channel
Algorithm sorts can be extremely loud, and seizures can be triggered by noises
Algorithm sorts can flash a lot, and seizures can be triggered by flashing
Be careful, and have a good stay!
H O W D O I D O W N L O A D I T
Do Double Binary Insertion Sort
Reverse Selection Sort
Stable Selection Sort
Stable Cycle Sort
Tree Sort (AA Balanced)
Wiggle Sort
Optimized Bubble Sort
Unoptimized Bubble Sort
Swapless Bubble Sort
Sample sort
Weaved Merge Sort
Iterative Merge Sort
Stable Merge Sort
Radix LSD Sort Base 2
Optimized Cycle Sort
@@RashaMaya123 DOES ANYONE KNOW HOW TO DOWNLOAD IT
@@ERRORRubiksZeraBrand YES
Radix is by far my favorite Sort. The absolutely Alien sounds, the way it seems to scroll across the screen, the chaos that suddenly turns into satisfying patterns. Just gorgeous
The first video of this sort is one of my favorite, the absolute power of the echo at the end
the scrolling of the screen is an effect of In-place LSD Radix Sort, not Radix Sort
Same but in place or out of place as I want
@@nhungduong3236You like inefficient sorting algorithms which literally defeat the whole purpose of a sort?
never thought it'd be so satisfying seeing the swaps counter finally hit 10 million at some point, lol
9:34 for the 10 million swaps
Oh god it was so satisfying, I read this comment at the start of the video and checked every counter until the 10 million, it was always so close it hurted
i thought i was the only one
So satisfying 😭
Imagine it says 9,999,999 😂😢
I love those "TA DI DI DA DA DI DI DA DA" parts when the small peaks come all together after the big figures
Me when searching a song I don’t remember the name of:
lmao
I like the OUUUUUUUUUUUUUUUUUUEEEEEEOOOOOOOOOEOEOEOEOEOEOEOEOEOEOEOEOEO at the end and the DUDUDUDUDUUUDUDUDUDUDUDUDUDUDUDUDUDDUDUDUDUDDUDUDUDUDUDDUDUDUUDD at the beggning
“TA DI DI DA DA DI DI DA DA”
I feel like now would be a good time for us to tell you that there are no voice tones on the internet
I also like radix sort but merge sorte is best for me
Sounds really cool, and the LSD naming is hilarious
PS I have a newfound obsession with sorting algorithms, especially these radix LSD ones
lsd stands for least significant digit, and this sort is sorta inneficient, however there are cool and efficent sorts like american flag sort
Same
And yes its absolutely hilarious it's named LSD sort
-it fits-
ok, *nerd*. i wonder who this **nerd** is.@@edwardclark6731
LSD Radixsort has gotta be my favourite sort, just because how rugged it is, you can just about throw anything at it and it'll sort it in a respectable amount of time, and every sort takes a almost fixed amount of time, even on the in-place version, and the pre-final pass being sorted is just so satisfying to watch and hear, even if you throw the most bonkers list at it
its ass
try sorting [1, 2, 34859295492942, 8] with lsd radix sort
it'll take long asf but insertion sort will do it instantly
@@bitonic589 In what real world application would you put LSD Radix through a 4 digit array with wildly different values?
@@bitonic589but here's the thing, insertion takes longer than than Radix LSD in huge arrays,which is why i think double insertion sort should be more used.
@@bitonic589low amount of numbers is an ass example
Radix Base 10 sort be like:
1. Check entire thing
2. blblblblblblblbl
3. done
The orders you said are correct! Congratulations! Here's a billion dollars!
1. Scan
2. EAUOHEBEAEBOEHAOEHO
3. blblblblblblblblblblblblblblblbl
4. errrrrrrrooooooiiiiiii
idk why im so obsessed with sorting algorithms especially cuz ik what basis most of them are going by to sort things but
5:15
i like this one it sparks joy
00:05:30🍓
0:19 listen closely and you can hear the THX intro
but perfectly cutoff
your average radix in-place LSD base 10 consists of:
-efficiency
-sounding like an alien in a microwave
-broken music disc
love that running radix start to finish on "radix final pass" creates a sort of shepard tone on the second(?) pass
I like when it starts the Shepard tone for a minute
1:46 えええええーぅううううううあおあううううう！！！！！
Theses frequances sweeps are quite good at stressing speakers, it help them softing their suspensions and test their bandwidth.
the fan favorite
Who else really misses dubstep? 💕
I love it it is like a cheque printer chucking out stuff
This is what everyone comes for
1:45 It sounds like music from Portal
This is my favorite sort - and the weirdest one for sure. It's so weird that bro literally made a whole video dedicated to it.
To explain what this sort is doing technically, it's actually startlingly simple:
Take the value of the last digit of the element's number and sort them by it. (So for example if something's value is 1485, 5 is its what it sorts by). This digit is called the least significant digit, where the algorithm gets its name from. (LSD)
Anyway, next do the same sort for the next digit to the left of each element in each category, or the next least significant digit of the element. Then do the same thing again for the next LSD, (repeating this for each and every number of digits in all the values, in this case four) then the final digit, or the most significant digit (MSD).
Doing this will sort the list by its value.
The reason why this works is because it's a stable sort: the elements are arranged in sorted form and stay that way between steps within their "categories" often called buckets, of the previous step. That's also why it "sounds" like it's raising in pitch in the final step, because if you think of it in terms of each bucket they're already sorted.
у меня в глазах рябит от этого но я не могу оторваться
I thought in-place meant no writes to auxiliary arrays
Nope, doesn't have to be that strict! There's a bit of leeway with the definition. Some would argue a sort that doesn't use O(n) extra space can be considered in-place. Note that this doesn't have to be in terms of just arrays! Quicksort uses O(log n) stack space, yet it's universally considered in-place.
Musicombo I like your funny words magic man
Lol, thank you? 😅
The aux space is just for the buckets and determining them. The items in the array are never moved out of place
@@Musicombo Do Over 300 Sorting Algorithms In Under An Hour
Reversed Inputs
what i think radix does is it scans the thing, and repeatedley slices the pieces into 10 little pieces, and i guess this happens so much it gets sorted.
LSD means least signifikant digit. It sorts the array based on only the ones place, then it sorts THAT array based on the tens place and then it sorts it based on the hundreds place and so on. Its always only the ones, tens and hundreds etc places that is considered, not the entire numbers, hence the comparisons counter stays at 0
Creel has a good video explaining radix sort : /watch?v=_KhZ7F-jOlI
I can't believe the whole sorting board moved in a single frame
Me: What’s 1+1?
My brain: 0:06
My brain: “3”
Oh its the "Why so quiet?" *3 seconds later* "Oh, thats why" guy.
This, but with a million numbers. I wonder how fast it will be?
computer crash moment
I wonder how SLOW* would it be
We are talking about Radix sort, man
@@costa-w3k _in-place_ radix sort is what is really slow.
If you allow for auxiliary data structures (like a helper array), then radix sort becomes one of the best around, with O(n) runtime.
Radix has a lot of overheads but it's also linear: it actually gets better in terms of efficiency compared to other algorithms with a lot of elements. Radix doesn't have to deal with an exponentially larger and larger number of comparisons to make as the elements increase, because it just checks the value of each one a number of times equal to its digits (in base 4 so each one has the same number of them). Other algorithms slow down a lot from so many elements to compare, but radix actually handles them like a champ because it essentially doesn't do any true "comparisons".
Oh my god it sometimes sounds like peeling off tape from the roll but continuous
Radix LSD Sort In-Place Base-10 Cool, Like
1. Random
2. Reversed
3. Almost Sorted
4. Many Similar
5. Scrambled Tail
6. Scrambled Head
7. Final Merge Pass
8. Sawtooth Input
9. Final Merge Reversed Array
10. Reversed Final Merge
11. Pipe Organ
12. Final Radix Pass
13. Final Pairwise Pass
14. Binary Search Tree
15. Heapified Input
16. Smooth Input
17. Poplar Input
18. Half-Reverse Input
19. Even Reverse Odd In-Order
20. Even In-Order Odds
21. Even Ascend, Odd Desascend
22. Bell Curve
23. Perlin Noise Curve
24. Perlin Curve
25. Triangular Input
Done
In-Place LSD Radixsort (Base-10): Reverse Sort
Radix sort base 2? Or base 1?
@Nehemiah Britt no, I mean, how would base one and base two work?
@@Ceafto2007 Base 2 would work similar to base 10 but with 2 buckets instead of 10 (Likely takes more combovers), but I'm not sure if there's a base 1 edition
base 1: it moves everything into the same bucket each time, but in a different order
equivalent to bogosort
@@HamStar_ lol bogo
Could be an interesting video
yeah this looks so trippy this algo HAS TO have taken some drugs
5:28 First one to sound different
6:01 First one to sound *almost completely* different
Imagine if someone made bad apple in this software
lmao its quita hard tho
edit: *quite
badapplesort
It's logically impossible
@@nhungduong3236 could approximate it
RADIX
but is there such thing as an unsorting algorithm?
Bogosort
shuffle
0:31 what was the point in that
moving on to the next sort, which was "what happens if the array is sorted backwards" sort
@@CSDragon how does this even work though, even if its all mixed up, repeating it enough times somehow brings it back to normal?
@@Matheus_Braz it's actually showing the worst possible case when it's completely backwards like that.
@@CSDragon yeah but how does repeating it, even when its backwards, just magically bring it back to normal??
@@Matheus_Braz here, so basically, it takes it, (i presume) and it makes it into groups, and keeps on dividing it into small pieces, and then grouping them into order, leaving a small grey bit, which is added onto the base, thus sorting it! i hope i helped!
tl;dr: it divides alot, then makes it triangle with grey, added to white.
i change my mind.
I think 00:07:33 is kinda Creeepy
(For Me)
Broken Machine!
404
040
440
004
444
000
044
400
After these videos I realized that I have sortophobia...
no idea how it works, but its so cool!!!
In normal LSD radix, the array is loaded into buckets of the values of the lowest digit, then unloaded back to the array, then rinse and repeat for the next digit up
@@smaybius Technically the bucket part is implementation detail, you just need to known how to sort the items by n-th digit
The sound when my computer is not computering
Basically it stabilly sorts every number by first digit, then second, then third, then fourth and etc... Sadly, it can sort only digits...
use like base two or base 5894
WHERE'S THE VOLUME >:(
...Huh?
@@Musicombo every radix lsd has loud sound...
Yes... and?
Everything is same, Except 00:05:30!
How does this algorithm work?
This sorting algorithm works by looking at a certain digit of every data point each pass, going from smallest to largets (i.e. 1s place, then 10s place, then 100s place, etc.) and sorting them in
to n (n being the base used, such as base 10 in this video) "buckets" based on the digit it looks at. once it goes through all the digits, the array is sorted.
Alimento Gato Adulto Don Kat
Xin Chúc Mừng Bạn Nhận Được 10.000.000 Người Đăng Ký
00:05:30❤️🔥❤️🔥❤️🔥
this is what lsd feels like
7:20 my brain at school:
32?
34?
what app is this?
Seems like the thx intro
cool video, i always want that app on my computer
This is looking like one of those Japanese music videos now
25 Ways to In-place LSD Radixsort Base-10
All Musicombo Sorting Videos
Start Redix from Final Redix then stop at Final Redix and repeat
30?
9:34
Bill...IGuess
10:00 10 million at 10 minutes for the 10^0th time!
FUCK YEAH
SORT IT ROOOIGHHT
0:51 THX Intro
LSB Radixsort in Embrassed No waveinvert mono only
Don't base 10, should be base 16 in radix LSD Sort in place
but what is update.
Seharusnya base 16 jangan 10, kalau pilih 10 kurang sempurna lihatnya
watch this on lsd
5:41 e: 6:02 wiwiwiwiwiwiwiwiwiwiwiwi
Sounds like lagging ps2 games
this is just base 10
Another one
WHAT
1,2 kg
Ghuo
2,1 kg
krnl sort 4.0
3
1
2
Funny but inefficient 😕
Mi
Fast
Slow
525 ms. ITS SLOW
/tp 65.50 68.56 65.50
This isn’t Minecraft
it’s called LSD for a reason