Cycle is really best for when you need to save resources, not time. As slow as it is, it's incredibly efficient resource-wise because it only ends up moving each value once, from its original position, immediately to its final destination. So yeah, this is really a pretty bad implementation.
@@GarryDumblowski it's clearly moving elements more than once in the video ... so if what you say is true, it's not just a bad implementation, but an incorrect implementation.
@@xorbe2 Agh, fair... I dunno, honestly. I mean, i'm pretty sure the best worst-case efficiency you can get is O(n log(n)) for a sorting algorithm, which I'm pretty sure means it has to move at least one element more than once. So maybe I was wrong about that.
Radix (LSD) sort is the kids that can finish the exam before everyone else and somehow get a perfect grade. The Cycle sort is the kids that already answers every question but keep checking the answers back and forth until the time is up. And Bogo sort is the kids that just pick random answers and hope they get the right answers.
Cristian G Dude, you don't have to play dumb, on his next video (Visualization and Comparison of Sorting Algorithms) the first comment is literally the same and it was made over a year ago.
Alright, I just checked it. It turns out that he was referring to Quicksort, not radix sort. Nonetheless, it is not like the phrase "SOMETHING IS OP PLS NERF" is original in the first place.
Radix sort LSD was the clear winner, finishing at a mere 13 seconds in! Second place was Radix sort MSD, which finished 17 seconds. 3rd was quick sort read desc (I cant read what the text says, it’s too small) with 18 seconds. Last place was odd-even sort, which was unable to beat bubble sort.
we are not been informed about the real cost of every sorting way, some of them are fast but expensive so not really efficient on a huge scale, and obviously the only reason for select a faster sorting algo its because u have a huge need, for small software etc u dont even feel the speed difference, or u dont even need it
Seems silly to have separate ternary quicksort algorithms on there, since the only time they differ from basic quicksort is when two elements are equal. But in your visualization all the numbers are distinct.
I kind of wish it used those height to sound pitch audio formations I usually see in other sorting algorithm videos. It'd be simply beautiful and absolutely terrifying.
Good job, really nice video! What did you use for the visualization? I like it. I would probably use something like MATLAB, gnuplot, or similar. Just wondering what's the most convenient way of doing it
Hey there! When my fork of The Sound of Sorting gets accepted, which includes several new sorting algorithms, it would be fantastic if you could remake this video, with the same music, all the sorts in this video included along with the new ones
they start in the same order, its just that some need time to start actually swapping the elements, so it seems like they started late. Still accurate.
Binary Insertion Sort is not being done properly. In Binary Insertion Sort, you do a binary search for the insertion point. This is showing a linear search for the insertion point, making it no different from normal Insertion Sort.
The issue is once you found your insertion point you have to move all the number behind the insertion point one space back which takes up all the time. That is why insertion does not do binary search it just do the shift and comparison at the same time since you have to do the shift anyway. It is faster if structure is a linked list but this is done on an array. Heap Sort does the same thing as binary search but it works on an array.
LightningShock counting sort is a resource hog when the range is large though. Like, to sort a set of 64 bit numbers in the worst case you need 2,048 petabytes of storage for your intermediate array, even if there are large gaps that are mostly empty.
![Lp. Сердце Вселенной #60 РОЖДЕНИЕ ЛОЛОЛОШКИ [Финал] • Майнкрафт](http://i.ytimg.com/vi/YoR0pAV9FVQ/mqdefault.jpg)
Come on Cycle, get it together. You've already sorted the array. Even Selection managed to finish before you've checked every.single.element.
It's a bad implementation.
Cycle is really best for when you need to save resources, not time. As slow as it is, it's incredibly efficient resource-wise because it only ends up moving each value once, from its original position, immediately to its final destination.
So yeah, this is really a pretty bad implementation.
@Marnige Look that's just what I've been told, so IDK.
@@GarryDumblowski it's clearly moving elements more than once in the video ... so if what you say is true, it's not just a bad implementation, but an incorrect implementation.
@@xorbe2 Agh, fair... I dunno, honestly. I mean, i'm pretty sure the best worst-case efficiency you can get is O(n log(n)) for a sorting algorithm, which I'm pretty sure means it has to move at least one element more than once. So maybe I was wrong about that.
1 - Radix Sort (LSD)
2 - Radix Sort (MSD)
3 - Quick Sort (dual pivot)
4 - Quick Sort (ternary, LR ptrs)
5 - Quick Sort (LR ptrs)
6 - Quick Sort (LL ptrs)
7 - Quick Sort (ternary, LL ptrs)
8 - Tim Sort
9 - Shell Sort
10 - std::sort (gcc)
11 - Merge Sort
12 - Smooth Sort
13 - Block Merge Sort
14 - Comb Sort
15 - Bitonic Sort
16 - Heap Sort
17 - Binary Insertion Sort
18 - Insertion Sort
19 - Selection Sort
20 - Cocktail Shaker Sort
21 - Gnome Sort
22 - Cycle Sort
23 - Bubble Sort
24 - Odd-Even Sort
From fastest to slowest, taken from the point that the code knew it was sorted (and not from the point that it was actually sorted)
BlueDiamond or very first ^^
BlueDiamond or very first ^^
bogo bogo sort is worse.
It sort the first number by bogo sort, then sort the first two, then sort the first 3.....
Here are all the times that each sorting algorithms finished
Radix sort (LSD) 0:14
Radix sort (MSD) 0:18
Quick sort (dual pivot) 0:20
Quick sort (ternary LR ptrs) 0:20
Quick sort (LR ptrs) 0:23
Quick sort (LL ptrs) 0:24
Quick sort (ternary LL ptrs 0:25
Tim sort 0:27
Shell sort 0:28
Std::sort (gcc) 0:28
Merge sort 0:29
Smooth sort 0:39
Block merge sort (wiki sort) 0:41
Comb sort 0:42
Bitonic sort 0:45
Heap sort 0:45
Binary insertion sort 0:53
Insertion sort 1:03
Selection sort 1:21
Cocktail shaker sort 1:25
Gnome sort 1:46
Cycle sort 1:54
Bubble sort 2:01
Odd even sort 2:04
Thank you so much 👍❤️🙏
I find your lack of bogosort disturbing.
*sad bogo noises*
wow, odd-even sort was even worse than bubble sort
It was made as a basic parallel algorithm
I know, you would think bubble sort would get dead last.
I thought bubble sort would be last too, but odd-even is even simpler, so it's slower.
That's odd.
Someone must have went to great lengths to make something slower than bubble sort.
That was sort of interesting.
This comment is sort of underrated.
Get out!
Was that pun intended?
Nice pun :))
Music
For a solid 10 seconds I genuinely thought that the music was just the sound of the sorting
It isn't?
Radix (LSD) sort is the kids that can finish the exam before everyone else and somehow get a perfect grade.
The Cycle sort is the kids that already answers every question but keep checking the answers back and forth until the time is up.
And Bogo sort is the kids that just pick random answers and hope they get the right answers.
where’s the bogo sort
underrated comment
@@smoketastic2s297 not in the video but bogo sort is just random sort.
Stalin sort is the one who does the questions they know how to and ignores the rest
Radix sort is OP
pls nerf
Well it only works on numbers. Anything that can be compared (aka a>b, a
Cristian G nigga, don't steal comments
REALwoombath if you even bothered to scroll through the entire 52 comments you would see that that im the only one that has this comment.
Cristian G
Dude, you don't have to play dumb, on his next video (Visualization and Comparison of Sorting Algorithms) the first comment is literally the same and it was made over a year ago.
Alright, I just checked it. It turns out that he was referring to Quicksort, not radix sort. Nonetheless, it is not like the phrase "SOMETHING IS OP PLS NERF" is original in the first place.
Radix sort (lsd) is like "omae wa mou shindeiru"
nani?
Its like getting bingo on the fifth turn
Omae wa mou narabegae.
Gravity sort is even faster check it out
@@kristijanross977 No, gravity and radix sucks, they can only work with numbers
wow, this slow few-element simultaneous comparison really helps to understand how it works, thanks for your work!
Ahh, get that music out of here!
The real music comes from the sorting.
do you randomly know what music this is?
i need the name
@@taureon_if you still need it
candy corn - dubby j boy
The music is synced oddly to the sorting…
Anybody else looking at cycle and thinking
YOU'RE ALREADY SOLVED YOU DONT HAVE TO CHECK LITERALLY EVERY SINGLE ELEMENT!!!
Should have put bogo sort in there XD
***** I like many things.
Nah quantum bogo sort is best boi
sorry if this comment seems random but here is how every algorithm placed
1st - Probably your best bet - Radix Sort (LSD) 0:12
2nd - Radix Sort (MSD) 0:16
3rd - Quick Sort (dual pivot) 0:18
4th - Quick Sort (ternary, LR ptrs) 0:18
5th - Quick Sort (LR ptrs) 0:21
6th - Quick Sort (LL ptrs) 0:22 - 0:23
7th - Quick Sort (ternary, LL ptrs) 0:24
8th - Tim Sort 0:25
9th - Shell Sort 0:26
10th - std::sort (gcc) 0:26
11th - Merge Sort 0:27
12th - Smooth Sort 0:38
13th - Block Merge Sort (WikiSort) 0:39
14th - Comb Sort 0:40
15th - Bitonic Sort 0:43
16th - Heap Sort 0:43
17th - Binary Insertion Sort 0:51 - 0:52
18th - Insertion Sort 1:01
19th - Selection Sort 1:19
20th - Cocktail Shaker Sort 1:23
21st - Gnome Sort 1:44
22nd - Cycle Sort 1:53
23rd - Bubble Sort 2:00
24th - Probably shouldn't ever use - Odd-Even Sort 2:03
Thanks dude.
counting sort
How did frickin' Gnomesort place better than Odd-Even smh
Problem with radix is that it only works on numbers (it uses division)
Friends don't let friends use bubble sort
I love LSD it is just great and quick and satisfying
you're talking about the radix LSD sort , right ???????
The kind that winners use.
Radix sort LSD was the clear winner, finishing at a mere 13 seconds in! Second place was Radix sort MSD, which finished 17 seconds. 3rd was quick sort read desc (I cant read what the text says, it’s too small) with 18 seconds. Last place was odd-even sort, which was unable to beat bubble sort.
The quicksort you're referring to would be dual pivot.
This is oddly satisfying.
bogo? why not bogo :'(
still ...
someone you don't know It would take forever.
Why not bogobogo sort?
Quick sort is actually...
Quick
I don't understand why so many algorithms are needed. Why not just leave one, the most effective one?
we are not been informed about the real cost of every sorting way, some of them are fast but expensive so not really efficient on a huge scale, and obviously the only reason for select a faster sorting algo its because u have a huge need, for small software etc u dont even feel the speed difference, or u dont even need it
Seems silly to have separate ternary quicksort algorithms on there, since the only time they differ from basic quicksort is when two elements are equal. But in your visualization all the numbers are distinct.
This song is a banger.
I kind of wish it used those height to sound pitch audio formations I usually see in other sorting algorithm videos.
It'd be simply beautiful and absolutely terrifying.
It's many algorithms at once so it's not possible
Winners and loosers: 1st: Radix Sort (LSD). 2nd: Radix Sort (MSD). 3rd: Quick Sort (dual pivot). 4th: Quick Sort (ternary, LR ptrs). 5th: Quick Sort (LR ptrs). 6th: Quick Sort (LL ptrs). 7th: Quick Sort (ternary, LL ptrs). 8th: Tim Sort. 9th: Shell Sort. 10th: std::sort (gcc). 11th: Merge Sort. 12th: Smooth Sort. 13th: Block Merge Sort (WikiSort). 14th: Comb Sort. 15th: Bitonic Sort. 16th: Heap Sort. 17th: Binary Insertion Sort. 18th: Insertion Sort. 19th: Selection Sort. 20th: Cocktail Shaker Sort. 21st: Gnome Sort. 22nd: Cycle Sort. 23rd: Bubble Sort. 24th: Odd-Even Sort.
my brain trying to think of the first letter in my counter argument:
What about bogobogosort? I don't have anything better to do until the heat death of the universe so that'd be a good sort to watch.
Would bogobogosort just be randomizing the values until you get the correct sorted array? Lol
BogoBogosort is like insertion sort but bogo sort screwed up the code.
Dw wikisort and bitonic sort u still are one of the hardest to understand with visualizations only
That feel when selection sort is done but you're still checking already sorted numbers...
when the music played i completely thought it was the sounds of the sorting
turns out it wasn't that
heap sort does its things WHILE stoping to paint the bars some colors while doing it. Clearly superior.
This is the Sorting algorithm race today we have special Contender with us colorful sorter
I want bogo sort and to have this go 20 years
#trendingsongs #trendingsongs2023 #trendingsongs2024 #trendingmusic #trendingdances #trendingtiktoksongs #trendingreels #trendingtiktokdances2023 #trendingshorts #trendingatsomepoint #trendingmoneybaggyo #trendingnewsmonik #trendingdances2024 #trendingtopicfuture
1:50 perfectly syncs to cycle sort finishing
The sound of it would be the sickest harsh noise track.
Radix and Quick Sort seem to win
Good job, really nice video! What did you use for the visualization? I like it. I would probably use something like MATLAB, gnuplot, or similar. Just wondering what's the most convenient way of doing it
a program called Sound Of Sorting
I kind of wish they all had the same random permutation. Just to really compare them all.
The beats are sick.
Sorts sorted by speed:
1# Radix Sort (LSD)
2# Radix Sort (MSD)
3# Quick Sort (dual pivot)
4# Quick Sort (ternary, LR ptrs)
5# Quick Sort (LR ptrs)
6# Quick Sort (LL ptrs)
7# Quick Sort (ternary, LL ptrs)
8# Tim Sort
9# Shell Sort
10# std::sort (gcc)
11# Merge Sort
12# Smooth Sort
13# Block Merge Sort (WikiSort)
14# Comb Sort
15# Bitonic Sort
16#
Heap Sort
17#
Binary Insertion Sort
18#
Insertion Sort
19#
Selection Sort
20#
Cocktail Shaker Sort
21#
Gnome Sort
22# Cycle Sort
23# Bubble Sort
24# Odd-Even Sort
25# Bogo Sort
26# Me
Where is Bogo Sort?
love the music!!
cycle sort: done
computer: NO LEMME DOU-TRI-QUA-QUINTUPLE CHECK THAT
for a second I thought that the sorts we making that music xD
Same
The fact that Radix Sort LSD and MSD is faster than all of the quick sorts scares me
Surprisingly there's a slower algorithm than bubble sort (odd-even sort)
Sick beat
Hey there! When my fork of The Sound of Sorting gets accepted, which includes several new sorting algorithms, it would be fantastic if you could remake this video, with the same music, all the sorts in this video included along with the new ones
Wish you haad arranged them by sorting speed, so the fastest sorter is in the top left, and the slowest is the bottom right
radix sord lsd: 1st place
odd even sort: last place
100 years from now this will be considered normal music
17: Me paid by the hour.
20: Me paid by the job.
For a second, I thought the algorithms were making music
So LSD is good? Wow. Better buy tons of it right now.
Why would you add music. *WHY!?*
Is there a website where you can use this visualizer? It feels like I see this everywhere so there’s no way this could be limited.
Yes please let me know too
hey, can anyone tell me how to use this, whats its use and where to get it?
The quicksort group is only slower than one other group, radix. It isn't called quicksort for nothing.
Please compare the fastest ones: Gravity, LSD, Quick, Flash, Time and std
Wait, that's not the sound of the sorting
Rank by speed in this video:
- Radix Sort (LSD)
- Radix Sort (MSD)
- Quick Sort (dual pivot)
- Quick Sort (ternary, LR ptrs)
- Quick Sort (LR ptrs)
- Quick Sort (LL ptrs)
- Quick Sort (ternary, LL ptrs)
- Tim Sort
- Shell Sort
- std::sort (gcc)
- Merge Sort
- Smooth Sort
- Block Merge Sort (WikiSort)
- Comb Sort
- Bitonic Sort
- Heap Sort
- Binary Insertion Sort
- Insertion Sort
- Selection Sort
- Cocktail Shaker Sort
- Gnome Sort
- Cycle Sort
- Bubble Sort
- Odd-Even Sort
the best background music would be just the sorting sounds
Where is my gravity sort
What the gap sequence use in Shell sort?
for a real accurate comparison all of them need to have the same starting order
it can't be done in Sound Of Sorting
they start in the same order, its just that some need time to start actually swapping the elements, so it seems like they started late. Still accurate.
@@Kino-Imsureq they don't start with the same array
is this the new skrillex remake
Binary Insertion Sort is not being done properly. In Binary Insertion Sort, you do a binary search for the insertion point. This is showing a linear search for the insertion point, making it no different from normal Insertion Sort.
It does, take a look at it again. It does in short moments.
it uses a binary search to find where to insert it, but it takes most of the time to do the insertion itself
The issue is once you found your insertion point you have to move all the number behind the insertion point one space back which takes up all the time. That is why insertion does not do binary search it just do the shift and comparison at the same time since you have to do the shift anyway. It is faster if structure is a linked list but this is done on an array. Heap Sort does the same thing as binary search but it works on an array.
Lol i thought the music was made by the sound of the algorithms trying to play some death grips music.
I'll use that Tim sort
guys how was radix sort first???? shouldn't nsquared complexity sorts be the first to finish for small arrays?
I saw Ethan in this video dancing to EDM.
Probably there is such of a balance between something and time, because I don't know, how each of these things work
Recently odd-even sort is the slowest sorting
Bruh if you lose against Bubble, something's wrong with you
Nice work
Radix Sort (LSD) is the winner!
This is really impressive, did u write this visualization program urself?
No, I used this program panthema.net/2013/sound-of-sorting/
But I wrote program for another video: ua-cam.com/video/ZZuD6iUe3Pc/v-deo.html
Could you do something like that for this visualizer? There are 21 list types and 13 algorithms. scratch.mit.edu/projects/191308642/
I WANNA HEAR THE BLEEP BLOOPS
How about flash sort?
no counting sort??
yeah , and neither gravity sort ... '^'
counting sort is illegally OP
LightningShock counting sort is a resource hog when the range is large though. Like, to sort a set of 64 bit numbers in the worst case you need 2,048 petabytes of storage for your intermediate array, even if there are large gaps that are mostly empty.
Way too OP lmao
Dynamic Range wants to know your location.
Radix sorts are the fastest, followed by Ternary Quick sort and Dual Pivot Quick sort.
No download link for the new algorithms?
how about quantum-bogo-sort?🤔
Let's get one thing in order...
Radix is the king!
Radix can be happy counting sort and shatter sort didn't show up.
@@derblaue Radix sorts are variations of counting sort with way less buckets.
The size of the array was so small, that heap sort almost lost to insertion sort oO
Sorting more like ear rape..
I saw this as the last one to sort, dies
Radix Sort (LSD) is the winner
Odd-Even sort is the slowest
You can include counting sort
I want to counting sort v/s radix sort
Radix
Quick
Tim
Shell
std
Smooth
Block Merge
Comb
Bitonic
Heap
Insertion
Selection
Cocktail
Gnome
Cycle
Bubble
Odd-Even
Recently radix sort was the fastest sorting
there are 5 quick sorts and no in place merge apparently
Why isn't the original sounds on it
Mr Jose Americo bring me here!
sad to see that bogo sort wasnt included
is counting sort way too powerful to be here?
counting sort is not in Sound Of Sorting
no bogosort? 😔