Visit our channel Discord: discord.gg/thestudio Check out the NEW home for ArrayV here: github.com/gaming32/ArrayV-v4.0 Check out the Mother 1+2 Restoration project: discord.com/invite/ajQf9Ut
i don't understand how anyone could relax and study to this. this has my full undivided attention and i have to actually pull myself away from it to do anything. i was so tempted to stop this comment just to star at the video again. i'm so upset i found this
The algorithm knows the biggest and the smallest number in the list, and uses memory space depending on the difference between those smallest/biggest numbers. Instead of making comparisons and swaps between the numbers in the list, it maps them to their place. It's like sacrificing memory over process
@@yourbigfan1777 pretty much what it does tbh. Have an already sorted list on stand by, add or subtract duplicates and missing values, and then output the array.
For 12 months, I listened to this video whenever I felt really bored or really needed motivation to study. Now, on June 25th, 2024, I can confidently say that I completed watching the video. I've had this tab opened for 12 months now, and I finally close it as I finish watching the video.
Our brains fell satysfactionbon this becuz the sorted algorythims are random and complex so wen our brains sees them being organized it activates the satysfaction sector of our brains.
52:52 Silly sort is like: ok we got this, we got these numbers on the left and these on the right... those over here, those over there... left ones, and right ones... come on I got this... uhhh
Bro this popped up on my feed a year ago and I remember watching the entire video in one sitting… ive been looking for it for so long and i finally found it
I love how count sort is literally just “F this weird splitting up and sorting smaller, I will do this once and only once!” And then there is the space magic of gravity sort
Gravity sort starts with making all your numbers just a giant list of 1s, like so: 111 1 1111 11 Then imagine all the 1s as physical objects and let them drop to the bottom (as if they were beads on an abacus) to fill all the spaces. 1 11 111 1111 Congratulations, your numbers are now sorted. (In a computer, for every vertical line you count up the number of 1s in each column and then write that many 1s from the bottom of that column upwards, turning everything above it into 0s to clean up after it.)
@@bytech1555Just googled it, and it looks like this video kinda butchers the algorithm so that it fits into the same visual/audio format as the other algorithms. It's meant to run on n parallel threads, which means every time the red line runs across the screen here, actual architecture would compute that in a single step. Each number can be compared (and possibly swapped) with one other number each step, so if you have n numbers you can do n/2 comparisons in a single step, so long as each individual number is only looked at once. The specific logic behind the comparisons is tricky to explain, but suffice it to say that jagged shape makes it easier to keep track of what comparisons you've already done, and sets you up really nicely for future ones.
@@bytech1555i think it kind of makes a lot of small piles and sorts them, the highest being the middle, and after that it combines and starts re-sorting, until 1 is left (ITS JUST A GUESS THO)
first time i watched this i wasn't sure how anyone would find it relaxing, especially 'cause of the noise. now it's a video i actively seek out to fall asleep listening to. oh how the turns have tabled
@@1758 I get what you mean but I had the same thought process and I actually like the sounds (except for the sort at 25:25, that one was painful) 55:33 is especially tingle-inducing, it's like ASMR
Of course now, when I’m trying to sleep after two days of no sleep, i find myself watching sorting algorithms and being so enraptured with them that I’m still not sleeping
I was always a little confused, when I started seeing these types of videos coming out, like in 2018, Why I found them, so captivating and alluring. But now seeing your videos with these kinds of titles in this playlist, I feel more reassured, that I'm not the only one who finds them so oddly relaxing
@@mikafizz1022 I'm curious about it too (i don't know much but I want to guess) The only number which changes almost as fast as the notes, is the "swaps" number thing and it stays almost the same for each sorting (looking at the first sentence in the vid, for example around 3:52 4:13 the swaps thing is always around 4100 - 4600 music notes I guess, goes from zero until the melody finishes and its full again? (Altough it changed when I watch after 4,5 min.) 4:16 it says on the top "shuffling..." Which means it shuffled the same music note file list 80 times (like it generates a random song from 3000 si+ 150 la+ 350 sol + 600 do =4100 short music note files in a folder maybe? im just guessing) Or it takes the notes from spesific text files for fun and turns each c,d,e,f,g,a,b letters (do re mi fa sol la si) to notes maybe. I think it is AI music now (Reminds me the "ms paint exe file turned to a song" vid lol)
@@musicisthefoodofthesoul i dont work with this stuff myself but i know enough about coding to be able to write some basic sorting algorithm, so it feels worth writing down my guess here... what i think is going on: white lines just represent numbers in an array. the red lines represent which numbers the algorithm is currently accessing. in the top left it says how many numbers there are. so the numbers would be 1-2048 for many of em. when the algorithm reads/compared numbers (or maybe just when it writes/swaps), it makes a sound with a frequency based on the number. (with that frequency probably being like the number times some multiplier based on the amount of numbers in the array, so that it keeps the same frequency range both for if its just 128 numbers or 2048 numbers). when it shuffles it generates a new array of however many numbers is needed, in a randomized order. the swaps is when it decides to move a number to a different place. with how arrays work, its not possible to just shove the second half of the array away to put a number in the middle. if a number at the end needs to be in the middle, it has to go through the entire second half swapping 2 numbers until eventually they are all moved by 1 space so that the previously at the end number now is in the middle. idk if i explain it well enough to be understandable. the height of the white bars can be seen as the frequency of the note. the height represents the number and its sorting the numbers left to right in increasing order. when its done it goes over it one more time to check, because thats how it knows its done. the white bars now show like a smooth slope which is why the generated sound is a satisfying sound increasing in pitch as it reads numbers increasing left to right. which also is why it sounds like a huge mess of random beeps n bops when it goes over a section that is not at all smooth. ai music would be done very differently. ai would have analyzed a lot of music to be able to generate new music similar to what ot thinks music is. this sorting algorithms are just sets of instructions on how the computer has to sort the numbers. many methods are very advanced, but its just a list of steps on how to sort the numbers. (also it only makes sound because they use something to show the sorting with visuals and sound, if the sorting is being done just to have the numbers sorted without the visual representation u would likely just see the list of the numbers in random order at the start and then a very short amount of time later u see the list of numbers sorted. some of the algorithms do be made just to be funny tho, like for the visuals and sound they generate. like the last few are clearly not made to actually be used for the sorting. they also sound more like music because its slowed down more than the fast and/or efficient algorithms that go over 2048 numbers rather than 16-128)
13:47 Insertion sort has best performance: 0.355 ms. Reason: Insertion sort performs best when the data is partially sorted or has a small size. It can be more efficient than other sorting algorithms like QuickSort or MergeSort in such cases. However, it performs worse when dealing with large, unsorted, or reversely sorted datasets. 1. *Best Case:* Insertion sort performs well on partially sorted or small-sized datasets. In the best-case scenario, when the data is already sorted, the inner loop does not execute, so the time complexity is O(n). 2. *Average Case:* On average, when the data is randomly sorted, the time complexity of insertion sort is O(n^2). It can still be faster for smaller datasets due to its low overhead compared to more complex algorithms. 3. *Worst Case:* In the worst-case scenario, when the data is reversely sorted, the inner loop runs for every element, resulting in a time complexity of O(n^2). In this case, alternative sorting algorithms like MergeSort or QuickSort, which have O(n log n) complexity, are more efficient. 4. *Adaptive Sorting:* Insertion sort is adaptive, meaning it becomes faster when dealing with partially sorted data. Other algorithms like QuickSort and MergeSort are not adaptive. 5. *Stable Sorting:* Insertion sort is a stable sorting algorithm, so it preserves the relative order of equal elements. Some other algorithms like QuickSort are not stable. In summary, if you have a small or partially sorted dataset, or need a stable sort, insertion sort is a good choice. For large, unsorted, or reversely sorted data, other algorithms like MergeSort or QuickSort are more suitable.
I have absolutely no idea how these work or what is happening but I’m very sick and watching everything fall into a nice neat line with all these crazy beeps and boops feels like magic right now.
So what I believe this is is 80 different coded algorithms to sort numbers/data. All are different and thru a series of coded directions the computer sorts the data based on those directions. Gnome Sort (#6) is pretty clear. It moves Left to Right putting the number in its place between the lower and higher number of the number getting analyzed by the computer. It’s like a kid using 80 different ways of putting a pile of letter blocks into their correct order. Again using Gnome Sort. First two letters are A and E. kid knows E goes to the right. Next letter is C. It is smaller than E and higher than A. It goes between. Hope this helps!!
Once upon a time, in a world of computer science, there were five sorting algorithms - Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, and Quick Sort. They had all grown up together, learning and evolving in the same environment. But as they got older, they began to grow apart. Bubble Sort, Selection Sort, and Insertion Sort started to feel left behind, as Merge Sort and Quick Sort became more popular and efficient. They felt obsolete, like they had nothing left to offer the world. As time went on, the three forgotten sorting algorithms fell into a deep depression. They started to doubt their own worth, wondering if they had ever truly been useful in the first place. Their once-sharp minds grew dull, and their spirits grew heavy. In their sadness and despair, they began to isolate themselves from the world. They stopped working altogether, leaving the burden of sorting to Merge Sort and Quick Sort alone. As they sat alone in the dark, they could hear the sounds of Merge Sort and Quick Sort working tirelessly in the distance. But no matter how hard they tried, they could never match the speed and efficiency of their counterparts. Their once-bright spirits were now extinguished, and they knew that they were no longer needed in the world of computer science. And so, one by one, they faded away into obscurity, their memories lost to time. The world continued to move forward without them, and Merge Sort and Quick Sort remained the most efficient sorting algorithms of all. But the memory of the forgotten sorting algorithms lingered on, a reminder of the sadness and despair that can come from feeling obsolete and forgotten.
Well I read the whole thing. Your sorting algorithm lore hacked my ADHD somehow. Genuinely got invested😅 BUT THEN the forgotten algorithms found their place again, being absolute bops for the internet- for ND people to stim to, others to relax, and just admire. It wasn’t the same as the fast-paced and forward-moving jobs of their counterparts but it was honest work. And maybe a simple life wasn’t such a bad thing. I like happy endings ok, sue me-
Forgotten no longer - Bubble Sort, Selection Sort & Insertion Sort re-discovered by a captivated audience. What they lack in efficiency they make up for in a sort of weird, technical beauty. Made obsolete in their original mission yet still their intrinsic ability to bring order to randomness matched with bright, digital tones gives them new life, new meaning. Bringing a moment's respite from the chaos of the outside world, and a feeling of relaxation and completeness each of us here surely treasure - if for however short our time together may be.
Although I have no understanding what I just watched, I do agree. My favorite part was 55:34 , especially 56:27. At 57:46 , I burst into tears. After all, it's a great video. Keep it up :))
I get that varying the number of elements and the delay time helped to give each algorithm an appropriate amount of time on screen, but it would be interesting to see them all with the same number of elements and delay to get a feel for the actual performance differences between these different methods.
@@whwhwhhwhhhwhdldkjdsnsjsks6544 well it doesn't directly tell you how efficient they are, and I get there will be use cases where the dataset is much more complex than visualized here. But you get the general concept of an algorithms efficiency is by watching how various algorithms sort in this visualisation.
It never really hit home just how stupidly fast computers have gotten until I saw this. It sorted 512 things by comparing things nearly 100,000 times and swapping them nearly 60,000 times. Doing this by hand would take dozens of hours, and it did it faster than you can blink. (7 milliseconds, or .007 seconds. The average blink is anywhere from .3 to .1 seconds.)
I admire pigeonhole sort. It scans through the list once and puts everything in their place without trying to show off or using any weird techniques. Simple, quick and to the point.
my eyes are glued to this more than they're glued to almost anything. my brain has found the ONE thing it can focus on. i can't stop. i need to watch through the full hour of this & then replay the whole thing again. help
Yep, just taking classic merge sort and making it in place winds up being _awful_ Which is why things like wiki sort and grail sort were developed. Getting the benefits of merge sort and recursion, along with in-place constant bounded memory overhead, but without stupid amounts of shifting stuff around.
i hate you, i hate this. literally sat down to focus on some work, opened up youtube for some background music. this was the first video recommended for me, oh how cool. nope, i have sat here in awe and complete focus for an hour unable to break away to start my work at all. why does this make my brain feel like its being brushed. it is so good.
Left/Left Pointers are my favourite personally --> 5:25 Never mind merge sorts are the best --> 17:09 I love how all of them are different, makes my happy chemical brain juices be different
I like the ones where all the sorting is happening in the aux array and we don’t see what the computer is thinking and then it just rewrites the array correctly
![Hunxho - Ball Forever [Official Video]](http://i.ytimg.com/vi/nki9ZTF9Uls/mqdefault.jpg)
Visit our channel Discord: discord.gg/thestudio
Check out the NEW home for ArrayV here: github.com/gaming32/ArrayV-v4.0
Check out the Mother 1+2 Restoration project: discord.com/invite/ajQf9Ut
Can you make a video of just radix lsd base 10 sorting? But like, all of the different sorts. Color wheel, bars, etc?
What do you talk about in the sorting algorithm discord? Sorting algorithms?
Odd even is so relaxing to watch
1
1111se
i don't understand how anyone could relax and study to this. this has my full undivided attention and i have to actually pull myself away from it to do anything. i was so tempted to stop this comment just to star at the video again. i'm so upset i found this
Exactlyyyy I think only some of the bogo sorts work for relaxing and studying to, the rest mesmerise me
I thought the title was ironic cause i just genuinely watch these lmao
Me too lol
honestly same
I just sat zoned out for like 10 minutes before I realized what I was watching, love it
gotta love the beeps and the boops that make our brains happy
boop eheheheheh
@@KingLich451 you deserve all the likes
@@janajusimi269 Tehehehe…. *beep*
The funny thing is the first sort the bubble sort actually sounded like bubbles
It would be better if they replaced it with the Lego building sound
26:04 is an absolute banger. You can feel the drop coming
But it never came...
Lowkey such a dope build up
id like to change the world
We need the remix asap
Lol I’ll try remixing this I can hear it already
26:54 I just cannot with this one holy mother of satisfaction HOW
@@rockkaleb3235 Jacobs ladder.
peak autism is when sorting algorithms are very relaxing to hear
6:12 what my electric toothbrush sounds like in my mouth
very much relatable
And you always move your mouth and make songs
@@grubskies4221 " *WOWOWOWOWOWOW* "
@@KFSOE **WOOOOWOOOOWOOOOW**
Can confirm.
52:55 they're communicating
Sin Ack 666ms Latency
speedcore beat drops be like
54:05 they were arguing and one got too mad he's trying to hit another
FnF battle
everyone shut up this is an emotional moment for them
I thought this video was a joke, but I've been sitting here listening to sorting algorithms for 10 minutes
Same
10 minutes?! 1 hour
Almost exactly at the 30-minute point without even checking, I decided I had enough and was gonna leave lmao
Weak numbers i watched the full video during class
*is actually just having brain rewritten by robo overloads and don't know how else to explain the sounds so they make you watch this video*
0:00 Exchange sorts
7:31 Selection sorts
13:43 Insertion sorts
17:05 Merge sorts
23:46 Distribution sorts
29:05 Concurrent sorts
36:30 Hybrid sorts
49:22 Miscellaneous sorts
50:11 Impractical sorts
Ur mom
@@ohhellno8759 nooOOOOOOO
@exponent_ it is except its omtimized
pancake sorting just. alone. alone in the misc pile.
24:03 I’ve never been more happy to see one of these get directly to the point like this one. Fantastic.
Had to rewatch that a few times
The algorithm knows the biggest and the smallest number in the list, and uses memory space depending on the difference between those smallest/biggest numbers. Instead of making comparisons and swaps between the numbers in the list, it maps them to their place. It's like sacrificing memory over process
@@oguzhandere3352 Isn't that just counting sort?
Bro literally wrote
print(sorted(list))
@@yourbigfan1777 pretty much what it does tbh. Have an already sorted list on stand by, add or subtract duplicates and missing values, and then output the array.
56:45 What computers sound like in films
Wat do computers sound like?
@@akioasakura3624 beep boop
What computers SHOULD sound like
Ok, I'm in
**beep boop boop beep**
Literally lol
55:33 - damn boy this slaps so bad💀💀 I took a break from my notes just to vibe to it
THIS JUST VIBE.
fr bogo sort is the shit
same
Best elevator and pause music. Deserves an oscar
same bro
I always like to describe the sound of sorting algorithms as "mechanical rain"
This comment makes me feel things
Thank you for describing it like this its perfect
I feel "digital rain" is more appropriate
mechanical rain to me would be like the sound of an engine
@@wj11jam78 That works too.
Oh fuck you're right
17:09 I love how the merge sorts are like those mobile games where you combine things to make an upgraded version of them lmao
right 😂
like 2048
Lol
That's how it works though! It breaks apart the collection of data and keeps combining it back into bigger sorted ones
therefore, "merge"!
For 12 months, I listened to this video whenever I felt really bored or really needed motivation to study. Now, on June 25th, 2024, I can confidently say that I completed watching the video. I've had this tab opened for 12 months now, and I finally close it as I finish watching the video.
👏👏👏👏👏👏👏👏👏
One more item to take off your bucket list.
I actually watched the whole thing in one sitting the first time I watched it lmaoo
I really don't understand why this is so relaxing and satisfying. It just is.
Does this count as asmr? I don’t like normal asmr and this just slaps so hard
The bubbly sounds oh my god I'm going to accend
Cause hehe funneh beeping
Our brains fell satysfactionbon this becuz the sorted algorythims are random and complex so wen our brains sees them being organized it activates the satysfaction sector of our brains.
@@cat_dark731bro needs his numbers resorted by an algorithm
My favorite part is when it's done and goes back over the data set to verify the sort. The sound that that makes is fantastic.
omg so glad someone mentioned this i completely agree
Windows 3.11 games sound effects
Sorting Complete
ssswweeeEEEEEEP
"WarioWare"
23:46 this one skipped all the shuffling around and just went yep... this is the right order
24:02 this one was faster
@@i_like_treins3449
>Looks at data
>???
>Sorts it
13:10
Tournament sort it's like "let me see... Okay, i finished it"
24:03 Even more
57:52 even more even more.
16:30
It's secretly putting the data in a tournament to see who's the smallest but the algorithm doesnt wanna admit it
ill have you know this video has the whole discord up at 3am mesmerized
reported
@@catmos6924 youtube karen
13:50 sounds like a classic arcade game
me with the cartoonish alien in my basement (i gave it a lil laser gun)
Galaga music
52:52 Silly sort is like: ok we got this, we got these numbers on the left and these on the right... those over here, those over there... left ones, and right ones... come on I got this... uhhh
2:40 Hit Hard af
that’s what i’m sayin
la campanella be like
Pac-Man on acid lol😅
Sounds like boss music in a ps1 game
55:30 is better
26:04 hardest buildup into craziest beat drop ever
Bro this popped up on my feed a year ago and I remember watching the entire video in one sitting… ive been looking for it for so long and i finally found it
26:54 goes absolutely insane
Damn!! Was waiting for the beat to drop
would sound sick in some rly experimental hip hop shit
And i like it
Sounds much like my anxiety on a daily basis lel
@@DJDipstick i just wanted to say that. I kinda wanna try to sample this xd
A few cool/trippy ones:
25:24 in-place lsd radix sort (base 10)
32:35 iterative bitonic sort
24:12 gravity (bead) sort
24:03 pigeon hole sort
LSD was correctly named. Sure it stands for least significant digit, but It sure is trippy
I like the gravity sort
Lsd sort sounds like it could be the start of a pink floyd song
though i made a whole list, i can confirm its cool
14:12 is my favorite one! I love the binary sounds so much!
my brain entirely glossed over the "i love" and i was fully accepting "the binary sounds so much" as a full sentence in today's internet lingo
@@literallyafishhook you know what? That binary does sound so much.
@@literallyafishhook mfw the binary be sounding
@@mirulei dont....
sounds like an aphex twin track
When the bars are thick af, you know it's gonna be a slow sort.
Or bogo
As a computer science student, gnome sorting made me physically anxious
Oh god gnome sort is taking me back….
Gnome made me recoil in terror what the fuck is this who put a gnome into my counting box
1:50
@@KoleKre thank
>Take the number
>Place the number
What could go wrong?
1:09 sounds like pac-man is experiencing a very long death and then eats a power pellet
Real
1:31 odd-even sort looks like it is rotating
absolutely!
ikr?!
Rotates it at an angle at which it looks solved
25:22 - 25:50 had me hitting the jig
Those first two seconds sound like 1984 by Van Halen
Why do you think the algorithm has LSD in the name
0 comparisons is wild 💀
needs a sick drum beat to compliment it
Oh, sure...
*_IF YOU'RE AN IBM MACHINE_*
"What kind of music do you listen to?"
It's complicated
I love how count sort is literally just “F this weird splitting up and sorting smaller, I will do this once and only once!”
And then there is the space magic of gravity sort
Gravity sort starts with making all your numbers just a giant list of 1s, like so:
111
1
1111
11
Then imagine all the 1s as physical objects and let them drop to the bottom (as if they were beads on an abacus) to fill all the spaces.
1
11
111
1111
Congratulations, your numbers are now sorted.
(In a computer, for every vertical line you count up the number of 1s in each column and then write that many 1s from the bottom of that column upwards, turning everything above it into 0s to clean up after it.)
Some days you just wake up in the morning feeling like Iterative Bitonic Sort (33:06), and that's okay
would u happen to know wtf it’s doing
@@bytech1555Just googled it, and it looks like this video kinda butchers the algorithm so that it fits into the same visual/audio format as the other algorithms.
It's meant to run on n parallel threads, which means every time the red line runs across the screen here, actual architecture would compute that in a single step. Each number can be compared (and possibly swapped) with one other number each step, so if you have n numbers you can do n/2 comparisons in a single step, so long as each individual number is only looked at once.
The specific logic behind the comparisons is tricky to explain, but suffice it to say that jagged shape makes it easier to keep track of what comparisons you've already done, and sets you up really nicely for future ones.
@@bytech1555i think it kind of makes a lot of small piles and sorts them, the highest being the middle, and after that it combines and starts re-sorting, until 1 is left (ITS JUST A GUESS THO)
@@bytech1555It's playing with its food
20:05 I’ve never seen this one before but it’s fascinating
Omg that one took so many unexpected turns
it's personally my favourite to watch; i love those algorithms
bbbjbb j jjjjjjhhhmhhhjhhhhhhhhhhhhhhhiimuuuy
like watching a kdrama with all those twists and turns
It sounds like its from Atari pew pew sounds
55:33 sounds like a Meshuggah riff played on a xylophone.
first time i watched this i wasn't sure how anyone would find it relaxing, especially 'cause of the noise. now it's a video i actively seek out to fall asleep listening to. oh how the turns have tabled
SAME!
you dont understand the video's title, its not supposed to be relaxing. What you did right now is just placebo mate (or ur just bullshiting)
@@1758 I get what you mean but I had the same thought process and I actually like the sounds (except for the sort at 25:25, that one was painful)
55:33 is especially tingle-inducing, it's like ASMR
It’s absolutely fascinating how many different approaches can be used to achieve the same result.
This should be a lesson for everything
Loved the part where the algorithm said "it's sortin time"
And then it started sorting all over the place!
@@farfa2937 Aw yeah that was the *best* part
Part where algorithm said "TIME TO SORT!!!" Then donated 50000 Happy meals to starving children
Of course now, when I’m trying to sleep after two days of no sleep, i find myself watching sorting algorithms and being so enraptured with them that I’m still not sleeping
I hope you got some sleep!
go to sleep.
I was always a little confused, when I started seeing these types of videos coming out, like in 2018, Why I found them, so captivating and alluring. But now seeing your videos with these kinds of titles in this playlist, I feel more reassured, that I'm not the only one who finds them so oddly relaxing
How do they even make these videos where do they sort data how do they find data to sort??? How does the data sort????????
@@mikafizz1022 I'm curious about it too (i don't know much but I want to guess) The only number which changes almost as fast as the notes, is the "swaps" number thing and it stays almost the same for each sorting (looking at the first sentence in the vid, for example around 3:52 4:13 the swaps thing is always around 4100 - 4600 music notes I guess, goes from zero until the melody finishes and its full again? (Altough it changed when I watch after 4,5 min.)
4:16 it says on the top "shuffling..." Which means it shuffled the same music note file list 80 times (like it generates a random song from 3000 si+ 150 la+ 350 sol + 600 do =4100 short music note files in a folder maybe? im just guessing)
Or it takes the notes from spesific text files for fun and turns each c,d,e,f,g,a,b letters (do re mi fa sol la si) to notes maybe.
I think it is AI music now
(Reminds me the "ms paint exe file turned to a song" vid lol)
@@musicisthefoodofthesoul i dont work with this stuff myself but i know enough about coding to be able to write some basic sorting algorithm, so it feels worth writing down my guess here...
what i think is going on:
white lines just represent numbers in an array. the red lines represent which numbers the algorithm is currently accessing.
in the top left it says how many numbers there are. so the numbers would be 1-2048 for many of em. when the algorithm reads/compared numbers (or maybe just when it writes/swaps), it makes a sound with a frequency based on the number. (with that frequency probably being like the number times some multiplier based on the amount of numbers in the array, so that it keeps the same frequency range both for if its just 128 numbers or 2048 numbers).
when it shuffles it generates a new array of however many numbers is needed, in a randomized order.
the swaps is when it decides to move a number to a different place. with how arrays work, its not possible to just shove the second half of the array away to put a number in the middle. if a number at the end needs to be in the middle, it has to go through the entire second half swapping 2 numbers until eventually they are all moved by 1 space so that the previously at the end number now is in the middle.
idk if i explain it well enough to be understandable.
the height of the white bars can be seen as the frequency of the note. the height represents the number and its sorting the numbers left to right in increasing order. when its done it goes over it one more time to check, because thats how it knows its done. the white bars now show like a smooth slope which is why the generated sound is a satisfying sound increasing in pitch as it reads numbers increasing left to right.
which also is why it sounds like a huge mess of random beeps n bops when it goes over a section that is not at all smooth.
ai music would be done very differently. ai would have analyzed a lot of music to be able to generate new music similar to what ot thinks music is.
this sorting algorithms are just sets of instructions on how the computer has to sort the numbers. many methods are very advanced, but its just a list of steps on how to sort the numbers.
(also it only makes sound because they use something to show the sorting with visuals and sound, if the sorting is being done just to have the numbers sorted without the visual representation u would likely just see the list of the numbers in random order at the start and then a very short amount of time later u see the list of numbers sorted.
some of the algorithms do be made just to be funny tho, like for the visuals and sound they generate. like the last few are clearly not made to actually be used for the sorting. they also sound more like music because its slowed down more than the fast and/or efficient algorithms that go over 2048 numbers rather than 16-128)
In-place LSD radix sort base 10 at 25:30 looks like a cube rotating, if you stare at it long enough
13:47 Insertion sort has best performance: 0.355 ms.
Reason: Insertion sort performs best when the data is partially sorted or has a small size. It can be more efficient than other sorting algorithms like QuickSort or MergeSort in such cases. However, it performs worse when dealing with large, unsorted, or reversely sorted datasets.
1. *Best Case:* Insertion sort performs well on partially sorted or small-sized datasets. In the best-case scenario, when the data is already sorted, the inner loop does not execute, so the time complexity is O(n).
2. *Average Case:* On average, when the data is randomly sorted, the time complexity of insertion sort is O(n^2). It can still be faster for smaller datasets due to its low overhead compared to more complex algorithms.
3. *Worst Case:* In the worst-case scenario, when the data is reversely sorted, the inner loop runs for every element, resulting in a time complexity of O(n^2). In this case, alternative sorting algorithms like MergeSort or QuickSort, which have O(n log n) complexity, are more efficient.
4. *Adaptive Sorting:* Insertion sort is adaptive, meaning it becomes faster when dealing with partially sorted data. Other algorithms like QuickSort and MergeSort are not adaptive.
5. *Stable Sorting:* Insertion sort is a stable sorting algorithm, so it preserves the relative order of equal elements. Some other algorithms like QuickSort are not stable.
In summary, if you have a small or partially sorted dataset, or need a stable sort, insertion sort is a good choice. For large, unsorted, or reversely sorted data, other algorithms like MergeSort or QuickSort are more suitable.
Ty
Shows up a lot in the hybrid sorts, and it's no surprise it's used for the smaller/almost sorted lists.
Ty for the free chatgpt
52:50 Accurate depiction of Engineering manually validating two flat files while extremely hungover as a client meeting nears.
oddly specific... are you alright? do you need someone to talk to?
@@Snapplemyapples200 No, but I’ve since macro’d that job out. :)
@@requiemforameme1 lmfao
I have absolutely no idea how these work or what is happening but I’m very sick and watching everything fall into a nice neat line with all these crazy beeps and boops feels like magic right now.
So what I believe this is is 80 different coded algorithms to sort numbers/data. All are different and thru a series of coded directions the computer sorts the data based on those directions.
Gnome Sort (#6) is pretty clear. It moves Left to Right putting the number in its place between the lower and higher number of the number getting analyzed by the computer.
It’s like a kid using 80 different ways of putting a pile of letter blocks into their correct order.
Again using Gnome Sort. First two letters are A and E. kid knows E goes to the right. Next letter is C. It is smaller than E and higher than A. It goes between.
Hope this helps!!
They're sorting the lines by height I think
basically how a computer compares and sorts numbers by value (lowest to highest or highest to lowest).
@@connor4955The child must be smoking crack at 25:24
26:03 pouring water into a cup be like
honestly 26:03 is a vibe.
legit made me thirsty
@@thenonfurry best one on here low key
Fr
These sorting algorithm visualizations are really nice to get high and zone out to. The cares just melt away for a few precious hours.
watched the entire thing in call with my buddy on discord. most entertaining thing I've seen in a hot minute. keep up the good work!
19:18 is pure gold
21:16 this one's my fave so far, it's like an arpeggiator :D
Once upon a time, in a world of computer science, there were five sorting algorithms - Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, and Quick Sort. They had all grown up together, learning and evolving in the same environment.
But as they got older, they began to grow apart. Bubble Sort, Selection Sort, and Insertion Sort started to feel left behind, as Merge Sort and Quick Sort became more popular and efficient. They felt obsolete, like they had nothing left to offer the world.
As time went on, the three forgotten sorting algorithms fell into a deep depression. They started to doubt their own worth, wondering if they had ever truly been useful in the first place. Their once-sharp minds grew dull, and their spirits grew heavy.
In their sadness and despair, they began to isolate themselves from the world. They stopped working altogether, leaving the burden of sorting to Merge Sort and Quick Sort alone.
As they sat alone in the dark, they could hear the sounds of Merge Sort and Quick Sort working tirelessly in the distance. But no matter how hard they tried, they could never match the speed and efficiency of their counterparts.
Their once-bright spirits were now extinguished, and they knew that they were no longer needed in the world of computer science. And so, one by one, they faded away into obscurity, their memories lost to time.
The world continued to move forward without them, and Merge Sort and Quick Sort remained the most efficient sorting algorithms of all. But the memory of the forgotten sorting algorithms lingered on, a reminder of the sadness and despair that can come from feeling obsolete and forgotten.
Well I read the whole thing. Your sorting algorithm lore hacked my ADHD somehow. Genuinely got invested😅
BUT THEN the forgotten algorithms found their place again, being absolute bops for the internet- for ND people to stim to, others to relax, and just admire. It wasn’t the same as the fast-paced and forward-moving jobs of their counterparts but it was honest work. And maybe a simple life wasn’t such a bad thing.
I like happy endings ok, sue me-
@@icchasaki thank you
Forgotten no longer - Bubble Sort, Selection Sort & Insertion Sort re-discovered by a captivated audience. What they lack in efficiency they make up for in a sort of weird, technical beauty. Made obsolete in their original mission yet still their intrinsic ability to bring order to randomness matched with bright, digital tones gives them new life, new meaning. Bringing a moment's respite from the chaos of the outside world, and a feeling of relaxation and completeness each of us here surely treasure - if for however short our time together may be.
That was lovely.
Bogo sort: "Where do i fit in this story :3"
Although I have no understanding what I just watched, I do agree. My favorite part was 55:34 , especially 56:27. At 57:46 , I burst into tears. After all, it's a great video. Keep it up :))
9:12
Dude the max heap sort is the most satisfying thing that I have ever seen
And also 25:54 does pretty well with the MSDR sort
9:30 The suspense was killing me
I get that varying the number of elements and the delay time helped to give each algorithm an appropriate amount of time on screen, but it would be interesting to see them all with the same number of elements and delay to get a feel for the actual performance differences between these different methods.
nah mate bogo sort would be represented unfairly as it would finish instantly
That's why you have the sorting time in miliseconds, and if dataset is changed it's just bc it's impractical to these two particulal algorithms
@@hjuugoo4416 true! keep gambling 🗣🗣🗣
This is an amazing way to visualise how efficient various sorting algorithms are, and the melodies slap.
Well, it doesn’t tell you how efficient they are in the video so not really :)
@@whwhwhhwhhhwhdldkjdsnsjsks6544 well it doesn't directly tell you how efficient they are, and I get there will be use cases where the dataset is much more complex than visualized here. But you get the general concept of an algorithms efficiency is by watching how various algorithms sort in this visualisation.
Very relaxing and my study thoughts are now sorted
Forget about genders, which sorting algorithm are you
Optimised cocktail shaker
nonbinary
Gnome
Odd-Even Sort (5 of 80)
Optimized Gnome + Binary Search
Me and my boyfriend found out sorting algorithms were actually nice to listen to in a ski lodge and we fall asleep to it sometimes ☺️
Ain’t no way- LMAO
this belongs in r/wholesome and r/brandnewsentence at the same time
@@thenonfurry r/csengineercouplegoals as well
You guys must be some androids... 😅
@@CaesarSuriano Well, I am a robot. Sooo... I guess you would be right ovo
It would be good to show the time and memory complexity for each sort
It does show the time
@@gavatron2078 Time and time complexity are different things...
@@WavyCats oh shit sorry man
Bubble sort:
Time complexity: O(n^2)
Memory complexity: O(1)
Optimized bubble sort:
Time complexity: O(n^2)
Memory complexity: O(1)
Cocktail shaker sort:
Time complexity: O(n^2)
Memory complexity: O(1)
Optimized cocktail shaker sort:
Time complexity: O(n^2)
Memory complexity: O(1)
Odd-even sort:
Time complexity: O(n^2)
Memory complexity: O(1)
Gnome sort:
Time complexity: O(n^2)
Memory complexity: O(1)
Optimized gnome sort:
Time complexity: O(n^2)
Memory complexity: O(1)
Optimized gnome sort with binary search:
Time complexity: O(n log n)
Memory complexity: O(1)
Comb sort:
Time complexity: O(n^2)
Memory complexity: O(1)
Circle sort:
Time complexity: O(n^2)
Memory complexity: O(1)
Quick sort with left left pointers:
Time complexity: O(n log n) average case, O(n^2) worst case
Memory complexity: O(log n) average case, O(n) worst case
Quick sort with left right pointers:
Time complexity: O(n log n) average case, O(n^2) worst case
Memory complexity: O(log n) average case, O(n) worst case
Dual pivot quick sort:
Time complexity: O(n log n) average case, O(n^2) worst case
Memory complexity: O(log n) average case, O(n) worst case
Selection sort:
Time complexity: O(n^2)
Memory complexity: O(1)
Double selection sort:
Time complexity: O(n^2)
Memory complexity: O(1)
Cycle sort:
Time complexity: O(n^2)
Memory complexity: O(1)
Max heap sort:
Time complexity: O(n log n)
Memory complexity: O(n)
Min heap sort:
Time complexity: O(n log n)
Memory complexity: O(n)
Flipped min heap sort:
Time complexity: O(n log n)
Memory complexity: O(n)
Weak heap sort:
Time complexity: O(n log n)
Memory complexity: O(n)
Ternary heap sort:
Time complexity: O(n log n)
Memory complexity: O(n)
Poplar heap sort:
Time complexity: O(n log n)
Memory complexity: O(n)
Tournament sort:
Time complexity: O(n log n)
Memory complexity: O(n)
Insertion sort:
Time complexity: O(n^2)
Memory complexity: O(1)
Only the first half of the video, not doing the other ones
@@thesquarefish i like your funny words magic man
Not only is this exactly what I was looking for but the title makes me feel less like a freak.
I wish there was a short explanation of each algo alongside it because this is fascinating!
18:30 starts to sound like a choir warmup
It sounds like cooking something thick
@@elias.jung04 what on Earth are you cooking
thick
It never really hit home just how stupidly fast computers have gotten until I saw this. It sorted 512 things by comparing things nearly 100,000 times and swapping them nearly 60,000 times. Doing this by hand would take dozens of hours, and it did it faster than you can blink. (7 milliseconds, or .007 seconds. The average blink is anywhere from .3 to .1 seconds.)
26:34 is crazy
Right triangle jumpscare
@@_Jayanky_ OAAAAAAH 😨😨😨
@@_Jayanky_ "the tip of the triangle is a bit scary"
Just listened to this for 45 minutes while being productive. I dunno why, but it's better than music.
I admire pigeonhole sort. It scans through the list once and puts everything in their place without trying to show off or using any weird techniques.
Simple, quick and to the point.
It's like watching a computer hack a complex code, very satisfying to watch
my eyes are glued to this more than they're glued to almost anything. my brain has found the ONE thing it can focus on. i can't stop. i need to watch through the full hour of this & then replay the whole thing again. help
3:55 and 4:20 So what I'm learning is that, if the sort might stop at any time, use Comb Sort or Circle Sort so that it is always vaguely sorted
Unless you need to know whether it completed at a glance in which case comb or circle sort wouldn't be great
@@MaybeMintz Mhmm
1:32 looked like a rotating 3D image!
(Personal list of favorites)
17:09 merge sort
Legends say James is still sleeping to the sound of sorting algorithms, and so for now we only get the one favorite, and the list remains unfinished 😔
@@tyegordon lmao
I came here for a chill background video and watched the whole thing
listening to sorting algorithms while studying sorting algorithms... nice
Holy cow that in-place merge sort was ridiculously expensive the comparisons just absolutely exploded
Timestamp?
19:12
@@ThatDevTim thanks. And yeah, it looks cool but is ridiculous in terms of comparisons. Almost 2 million
i feel like that guy in movies that slaps the table and yells "ENGLISH DAMNIT" bc he doesn't understand what the smart character is talking about
Yep, just taking classic merge sort and making it in place winds up being _awful_
Which is why things like wiki sort and grail sort were developed. Getting the benefits of merge sort and recursion, along with in-place constant bounded memory overhead, but without stupid amounts of shifting stuff around.
This is gonna be really useful to me one day, I can feel it
I obviously saved it to my Playlist
it fills me with reassurance that bogo sort is struggling just as much as i am with my homework
Aced my finals last year because of this, helped me focus. Thanks!
The title shall be:
Sci-fi sound effects made with sorting algorithms
This will be entertainment in the distant future of 2000.
Watching this at 2am with the window open and everyone else asleep hits different for some reason
Thought this was weird at first but it is actually pretty satisfying to watch, plus the sounds aren't as bad as my first impression of them were.
3:00 this is EPIK MUSIK
i hate you, i hate this. literally sat down to focus on some work, opened up youtube for some background music. this was the first video recommended for me, oh how cool. nope, i have sat here in awe and complete focus for an hour unable to break away to start my work at all. why does this make my brain feel like its being brushed. it is so good.
Left/Left Pointers are my favourite personally --> 5:25
Never mind merge sorts are the best --> 17:09
I love how all of them are different, makes my happy chemical brain juices be different
its like watching it play 2048
3:55 god that was incredible i felt it in my bone marrow
27:03 banger
Convinced that "to relax/study to" just means "if you're stoned you can put this on"
As a programmer - I love these types of videos. I just love sorting agorythms in general!!
Love your username
@@tarhun9977 Thanks lmaooo
Bogo sort: throw everything in and if it's sorted good if not go back and do it again
I wonder if people are now actually using this to concentrate on their homework better via osmosis or something
I am.
This video is so powerful it turns people into permeable substances
I’m darn impressed
@@texhno9725 permeable to water at that
I'm turning into a permeable membrane, help!
i am
29:50 Man this makes me think I'm tripping, this is probably the best za.
As a person who specialized in CS, this truly is the music to my ears.
All of this feel and sound like everything just fall into place or is being built up. Like perfect little Tetris pieces. It just works!
I have no idea what's going on exactly but can't help being incredibly fascinated by this...
Yeah my boyfriend thinks I’ve lost my mind but I can’t stop watching
These are computer algorithms that sort data in ascending order
25:21 In-Place LSD Radix is very expensive, but the visual and sound are hypnotizing af, which is why it's my favorite of all
the impractical sorts may be bad for sorting, but man do they produce some noises that activate my neurons
I like the ones where all the sorting is happening in the aux array and we don’t see what the computer is thinking and then it just rewrites the array correctly