Apparently the pidgeon hole sorting works so well here because it works best when the number of elements is similar to the number of unique elements. Since all elements in these examples are unique, the algorithm works fantastic.
Unique values and using all intervals, the pigeonhole is the perfect sort. Twist it a little by adding chaining and now you have bucket sort. Twist it a little more and you have radixsort LSD. But the reality is that radix came first, then came the others that applied it's logic.
Ah, um... Yeah. I just read how it works and it's pretty clear and underwhelmingly trivial why it works so well with an array of N elements containing exactly one copy of every number between 1 and N. With a few extra steps, you're basically deleting whatever is held in slot 1 and writing in 1, deleting whatever is held in slot 2 and writing in 2, et cetrra.
wrote it in python a = [3,5,1,4,2] def pidgeonhole(list): c = 999 for i in list: if i < c: c = i b = [0]*c for i in list: b[i] = i list = [i for i in b if i != 0] print(pidgeonhole(a)) im not even sure if it works
Cocktail merge sort: 1. Shake 1 fourth until it’s correct 2. Merge them Flash sort: 1. Examine the deck 2. ??? Gravity sort: 1. Look at the deck 2. Paint it red Hybrid sort: 1. Make a very rough stair case 2. Make each stair pointy 3. Merge the stairs Odd-even merge sort: 1. Make some spikes 2. Merge them 3. Use sand paper to smooth it out Pancake sort: 1. Build a slope from the top with some weird peices Pidgeon-hole sort: 1. Look at the arrangement 2. Do it again 3. Done Radix LSD in place 1. Look at the deck 2. Summon the dark lord
radix sort basically sorts the numbers based on the most consequential digit (the digit with the highest value), and then sorts the numbers again based on the second-most consequential digit, and so forth until it is sorted.
@@JiMMy-xd8nu pigeonhole sort and counting sort are actually the fastest sorting algorithms, but require massive amounts of ram in most circumstances. If you have a small range of data (like numbers 1-10) then it's the best option.
Another sorting routine that runs in O(n) time: Stalinsort. It goes through the list one element at a time, and if the next element is not in sorted order it deletes that element. You are left with a sorted (and much shorter) list
Sorting algorithm idea: fluid sort. 1. Make a fluid simulation 2.Make unmixable fluids (like oil and water) for each item you want to sort 3.Set the density of each fluid equal to the value of the item 4.put all of them in a container 5. Simulate the liquids untill they form layers 6. Bam! You sorted the items!
Flashsort is pretty quick until that last round to adjust it a bit. Also, I have seen from the 16 Sorts: Disparity Dots video that Gravity sort is basically this: Step 1: Scan each one and figure out where it should be. Step 2: Assign each of them their own personal gravity to pull them to where they should be. Step 3: Let the gravities do their jobs. Hybrid Sort seems to be just that: a hybrid (of Quicksort and Merge Sort and some others). And you guys are saying that Gravity Sort is weird...Pigeonhole Sort is the weird one! It seriously just scans it twice and then puts it together more or less effortlessly!
Personally I prefer to use miraclesort because it’s just so easy. Just check if data = sorted, and if it isn’t, then wait a while and ask again. Random bit flipping and other errors/diving intervention will eventually result in data = sorted being true because everything with a nonzero probability will happen given sufficient time. It’s also pretty computationally efficient! It’s like bogo bogo sort but even better!
What's the parameters on pidgeonhole sort because that shit is impressive. It takes two runs of an unsorted array and then just puts them in order by the third
SnowFireBlues Pigeonhole sort actually does a lot of work in copy arrays which aren't visualized, so you don't see the whole thing here. You can visualize the copy array, but I'm having trouble with my Linux so I can't compile it on this visualizer. I could show it on mine, which is built on windows, but it won't have sound.
If you could that'd be amazing, I don't exactly care much for the sound, although it's a good touch. But perhaps the more important question is, how efficient is it. Speed/memory usage/accuracy
I have idea for a sorting algorithm. Take the first item on the list, then compare them with a random item on the list. Adjust them accordingly, then do it for every other item on the list. Once they've all been compared, compare first one to thee second and see if they are order. If so continue comparing, if not repeat the first process.
I'd like to know what these algorithms actually are, compared to the ones we know from school. Thought I'd find links or brief description in the description, but no. :(
Most of them you can look up...however, "hybrid sort" is kind of weird. I think it's a bunch of dual-pivot Quicksort passes, followed by using Timsort to exploit the large-scale order of the result.
I have no idea how I got here, I have no idea what is going on, and I can't look away. It's like a mathematical simulation of what I assume to be an acid trip in a data center
Most other algorithms: You want me to sort it? Okay, first I need to see what I am sorting, then I gotta compare this to this, gotta group these into groups, gotta sort each individual group, gotta merge the groups, gotta sort the groups again... Gravity and Pidgeonhole: You want me to sort it? Okay, first I need to see what I am sorting. Then I sort. Alright, done!
May I have a look at the source code for "Radix LSD In-Place" based on this? It seems to run at about the same time as the original one and it appears to be less memory-intensive for the fact that it is an in-place version, which is quite impressive. I have been looking everywhere and the Wikipedia and some other sources implement the out-of-place ones. w0rthy also implemented an in-place version but it looks different from this.
Yeah, pastebin.com/SKgjz7mh While this uses a SortArray object which is used with this visualizer, it's not too hard to convert it to a vector or int array.
6infinity8, of course, that is why it has never been implemented for practical uses. It works great with integer types (and theoretically with floating-point formats). It may be an advantage for a programming language that sorts integers with its default algorithm, such as Java. But the use of it is very limited, indeed, compared to others.
@@sortingstuff6357How is that implementation of Radix LSD in-place? Is it not creating an additional array (vector) the same size as the input array?
hmm yes lets split the list into 4 parts and use cocktail shaker sort with the 4 segments and use merge sort once they are sorted and call this cocktail merge sort
Cocktail Merge Sort brings up a question I’ve had since seeing Merge Sort for the first time: which algorithm is Merge Sort just a “divide and conquer” approach to?
Calling it "divide and conquer" of another algorithm is a bit of an oversimplification. What it really does it just split things in half over and over again until it can work on the scale of individual pairs of items, then it just has to sort each of those pairs (which is easy, you just figure out which comes first and swap them if they need to be swapped), and then work its way back up by merging the already-sorted pairs (which is easy since you only have to look at the first item in each, and you can do it in the reverse order you split them in half with to only have to look at the tops of two lists at once).
For people like me who checked the comments hoping they wouldn’t have to Google: Pancake Sort is so bad because the only operation it has is to reverse the entire list up to a certain point - like sticking a spatula into a stack of pancakes and flipping what’s above it over. That’s why you often see the tallest unsorted element at the very beginning for a split second - it put it there, and it’s about to flip the entire unsorted portion to put it in the right place.
GUYS I JUST DEVIDED 0 Block: Braille Patterns, U+2800 - U+28FF[3] Plane: Basic Multilingual Plane, U+0000 - U+FFFF[3] Script: Braille (Brai) [4] Category: Other Symbol (So) [1] Bidirectional Class: Left To Right (L) [1] Combining Class: Not Reordered (0) [1] Character is Mirrored: No [1] HTML Entity: ⠀ ⠀ UTF-8 Encoding: 0xE2 0xA0 0x80 UTF-16 Encoding: 0x2800 UTF-32 Encoding: 0x00002800 is the answer for 0 devided by 0
anyone who's played bootleg programmes titled "180 games!" hardly fitted onto gameboy cartridges is not surprised by these weird glitchy noises, in the slightest.
This is actually a really cool vid! Obscure is interesting! If anyone can tell me how these work, I'd love to know! I'm not really into coding just yet-
I recommend looking up the videos online, try to find ones explaining it to the general viewer, rather than someone trying to implement it into some code.
Gotta love that pancake is so inefficient that you had to drastically lower the amount of items.
oloz
😂😂😂
It’s like bogo sort but it actually sorts😂😂😂😂😂😂
Lol
Come in crazy
Apparently the pidgeon hole sorting works so well here because it works best when the number of elements is similar to the number of unique elements. Since all elements in these examples are unique, the algorithm works fantastic.
Unique values and using all intervals, the pigeonhole is the perfect sort. Twist it a little by adding chaining and now you have bucket sort. Twist it a little more and you have radixsort LSD. But the reality is that radix came first, then came the others that applied it's logic.
Pidgeon hole and gravity sorts are both literally witchcraft
So u can just edit your data to remove duplicates and then add them back at the end???? Makimg pigeonhole the most OP algorithm???
Ah, um... Yeah. I just read how it works and it's pretty clear and underwhelmingly trivial why it works so well with an array of N elements containing exactly one copy of every number between 1 and N.
With a few extra steps, you're basically deleting whatever is held in slot 1 and writing in 1, deleting whatever is held in slot 2 and writing in 2, et cetrra.
wrote it in python
a = [3,5,1,4,2]
def pidgeonhole(list):
c = 999
for i in list:
if i < c:
c = i
b = [0]*c
for i in list:
b[i] = i
list = [i for i in b if i != 0]
print(pidgeonhole(a))
im not even sure if it works
Pigeonhole sort:
Step 1: look at it
Step 2: look at it again
Step 3: FOOSH
Step 4: profit
thats counting sort
@@nathanzotov1160 Ikr.
@@nathanzotov1160counting sort examines the array 5 times instead of 2
@@ProTheRobloxer no?? counting sort finds the min in one pass, max in one pass, and finds duplicates in the third pass.
that's 3 passes not 5
Counting sort examines the array 3 times, not 2* @@ProTheRobloxer
What I learned:
Strange noise
Kinda strange noise
woooooOOOOOOOOP
now it’s sorted
Cocktail merge sort:
1. Shake 1 fourth until it’s correct
2. Merge them
Flash sort:
1. Examine the deck
2. ???
Gravity sort:
1. Look at the deck
2. Paint it red
Hybrid sort:
1. Make a very rough stair case
2. Make each stair pointy
3. Merge the stairs
Odd-even merge sort:
1. Make some spikes
2. Merge them
3. Use sand paper to smooth it out
Pancake sort:
1. Build a slope from the top with some weird peices
Pidgeon-hole sort:
1. Look at the arrangement
2. Do it again
3. Done
Radix LSD in place
1. Look at the deck
2. Summon the dark lord
Radix LSD in place:
1. Look at the deck
2. Summon the dark lord
3. Delete him with lasers
Have you heard Radix LSD In-Place Base10?
flash sort 1 look at deck 2 make a triangle use 3 use le sand paper
i like your description for gravity sort
radix sort basically sorts the numbers based on the most consequential digit (the digit with the highest value), and then sorts the numbers again based on the second-most consequential digit, and so forth until it is sorted.
Gravity sort is black magic: it is like "let there be sort!" and sort
Gravity sort is actually a very inefficient way of going about it though
th-cam.com/video/MneHbUXyKHg/w-d-xo.html
what about pigeonhole sort?
@@JiMMy-xd8nu pigeonhole sort and counting sort are actually the fastest sorting algorithms, but require massive amounts of ram in most circumstances. If you have a small range of data (like numbers 1-10) then it's the best option.
@@Julian_H Thanks
Another sorting routine that runs in O(n) time: Stalinsort. It goes through the list one element at a time, and if the next element is not in sorted order it deletes that element. You are left with a sorted (and much shorter) list
🤣
This sounds cool
We could have mao sort.
Step one: Iterate an item.
2: Set the value of the item to 0.
Step 3: Any items that can't be set to 0 get deleted.
Better send every element which is not sorted to the gulag
Doesn't that depend on what kind of data structure you have and that it has O(1) delete time?
Ah, your other video was quiet so I had to raise to full volume. This one was not quiet. I can see a new color now.
Ultrared or infraviolet
since you have xray vision now can you look under my house and see if there is a 10 trillion dollar bill
@@mateuszodrzywoek8658 Probably octarine.
@@mateuszodrzywoek8658 not sure, could be visible X-rays...
Gravity sort is some spooky stuff.
Oh Waker It's actually quite slow in practice though.
The time it takes is solely based on the sum of all the numbers inputted.
th-cam.com/video/MneHbUXyKHg/w-d-xo.html
Its my personal favorite
For me the most scary is the hybrid sort
So we just not gonna talk about how pigeonhole sort just did it
1: scan the different numbers
2: count how many of each number there are
3: SORT!
@@thehiddenninja3428 That's counting sort, isn't it?
@@minetech4898 Pigeon counts twice
@@joeybarela363 actually no
@@нинажучкова-д2б Enlighten me, will you?
What did I just watch? All I got out of this was a couple of minutes of some cool sounds and some bars that align themselves to make a stair
0:50
The literal definition of
“Ironing out the kinks”
3:58
My kindergarten class when I "accidentally" curse
what a bitches dud
@@itsfadixx imagine calling fictional kindergarteners bitches. lol
@@_xndr7027 in all fairness, they were bitches
@@MayOrMayNot06 they were _pussies_
“4 replies.”
“Can i see them?”
“no”
1:35
I like how it starts working on the next part and then it realizes it didn't finish the last segment.
me trying to work on any project:
Sorting, sorting, sor-
This one's wrong, let me fix it real quick..
Sorting, sorting, sorting
"almost ther- wait hold on"
Sorting algorithm idea: fluid sort.
1. Make a fluid simulation
2.Make unmixable fluids (like oil and water) for each item you want to sort
3.Set the density of each fluid equal to the value of the item
4.put all of them in a container
5. Simulate the liquids untill they form layers
6. Bam! You sorted the items!
7. Realise that simulating liquids is more intensive and time consuming
the answer to the question “what if bubble sort were even less practical”
Ah yes the O(n^69) algorithm finally
@@zaydabbas1609 its probably O(n^morb)
oh my god
3:54 brace yourselves we're taking off
Gravity sort is me when the teacher asks me to show your working
1:01
Gravity Sort is like...
"Let me check,"
"And..."
"Done..."
Gravity sort actually changes the value of every item in the list until it's sorted, so it cannot be implemented in the real world.
Flashsort is pretty quick until that last round to adjust it a bit.
Also, I have seen from the 16 Sorts: Disparity Dots video that Gravity sort is basically this:
Step 1: Scan each one and figure out where it should be.
Step 2: Assign each of them their own personal gravity to pull them to where they should be.
Step 3: Let the gravities do their jobs.
Hybrid Sort seems to be just that: a hybrid (of Quicksort and Merge Sort and some others).
And you guys are saying that Gravity Sort is weird...Pigeonhole Sort is the weird one! It seriously just scans it twice and then puts it together more or less effortlessly!
And counting sort too
artemetra
Counting sort does everything in a different array, where it counts
“ok, a 1, a 500, another 1…”
And places them in order.
Psudocode for gravity sort;
Boolean stillSorting = true;
While (stillSorting):
stillSorting = false;
for(int i = 1; i < list.length: i++):
If(list[i - 1] > list[i]):
stillSorting = true;
swap(list, i - 1, i);
i++
Boggless that's bubble sort
@@boggless2771 That is definitely not gravity sort because your pseudocode makes comparisons. Gravity sort is a non-comparative distribution sort.
Personally I prefer to use miraclesort because it’s just so easy. Just check if data = sorted, and if it isn’t, then wait a while and ask again. Random bit flipping and other errors/diving intervention will eventually result in data = sorted being true because everything with a nonzero probability will happen given sufficient time. It’s also pretty computationally efficient! It’s like bogo bogo sort but even better!
1:22 when you play pac-man on the broken arcade machine
Flash sort:
Step 1: represent the final image
Step 2: E N H A N C E
Step 3: repeat step 2
Step 4: profit
The Hybrid Sort has to be the most terrifying sound I have ever heard. Imagine that in horror game. That would be terrifying!
me, a wanna-be game dev: you gave me an idea
you watch too much creepypasta.
It reminded me of the underground level in Mario Bros 😫
add some spooky effects and you've got nightmare fuel lmao
Everyone talks about the Gravity Sort in the comments, but that Pigeonhole Sort is as impressive! :)
What's the parameters on pidgeonhole sort because that shit is impressive. It takes two runs of an unsorted array and then just puts them in order by the third
SnowFireBlues Pigeonhole sort actually does a lot of work in copy arrays which aren't visualized, so you don't see the whole thing here. You can visualize the copy array, but I'm having trouble with my Linux so I can't compile it on this visualizer. I could show it on mine, which is built on windows, but it won't have sound.
If you could that'd be amazing, I don't exactly care much for the sound, although it's a good touch. But perhaps the more important question is, how efficient is it. Speed/memory usage/accuracy
Kerwin C I'd love to know the answer to that
Umm then why not for pidgeonhole, use it when temp memory is enough, and if it isn't, use another sort algorithm, like gravity sort of quick sort
This video does a very good job explaining it th-cam.com/video/nVQz0kZNC64/w-d-xo.html
pancake sort is one of the most inefficient sorting methods, it's so inefficient you had to use fewer items otherwise it would take forever
Pidgeonhole Sort is basically like that one kid who can’t solve a Rubik’s cube but is able to peel the stickers off and put it back in as a profession
hybrid sort is the official soundtrack for anxiety
Gravity sort:
Step 1: take good look
Step 2: ATTAIN SINGULARITY
Step 3: ???
Step 4: yay you did it
I like how when I watched jerma's vod on The Coin Game, youtube recommended me this because it detected it in the video.
Thanks youtube.
A e o
Beginning: Wab-wab-wab
After that: Woob-woob-woob
End of each algorithm:
UuuuuuWAAAAAAP
1:53 sounds like flight of the bumblebee
XD
Hahaha I was looking for someone to say this
3:54 Who is stealing my car???
Is that a spaceship leaving?
I know nothing about sorting algorithms but this video popped up on my recommended feed and I'm glad I watched it! This video has me intrigued!
Radix LSD In-Place is just like a futuristic F1, with 80% of the power on electricity, flying with an anti-gravity engine from the year 2069
the sudden silence after the pure hellish cacophony of noise that is the pigeonhole sort was actually quite disturbing
Is it just me or does the radix lsd in-place sound like a Shepherd’s tone?
That's what I keep saying!
It doesn't sound like one, it is one
while it's sorting, it sounds like a ton of little colorful rectangles freaking out and screaming
OK, pigeonhole, aka counting sort
counting checks twice, pigeonhole checks once
Flurby That Weird Kirby
Ok, so in the video it was wrongly labeled.
Lucas Fuckgirl
I think Counting should only check once, and Pigeonhole should check twice.
3:30 Anime sort
1:03 **hell rises**
aw man, I love this playlist! tons of great songs
Radix LSD In-Place:
1. Look at the deck
2. Repeat an unnecessary amount of times
3. Make the Sheppard's tone because you're bored
4. And it's done
I have seen these videos all throughout my life and I will never understand how they work or why they exist, but brain go *serotonin*
I have idea for a sorting algorithm. Take the first item on the list, then compare them with a random item on the list. Adjust them accordingly, then do it for every other item on the list. Once they've all been compared, compare first one to thee second and see if they are order. If so continue comparing, if not repeat the first process.
Sounds like a variation on Bogosort.
Call it the bozo sort
i came up with this exact idea when i was younger
sounds like a gnome/bogosort hybrid with stoogesort right at the end
really inefficient, hard to code, and slow asf
Gravity Sort: veni vidi vici
Also pigeonhole sort.
"Drop the drugs!"
"its okay 🅱️ibba, I got the 3:30"
Ranger using his cool gun that does damage
Wow, Pancake is the slowest algorithm I've ever seen. Pidgeonhole is pretty cool but I assume it uses a ton of memory.
hybrid sort is (1:10) :
insertion sort + quick sort + merge sort
It's a hybrid
gravity sort feelsgoodman.jpg
Hybrid sort is a good representation of me trying to get chores done
Be nice to Pancake sort, they've only been on the job for a week and it's their first time in the field!
this is strangely satisfying
I want hybrid sort to be played on all my birthdays, on my wedding and on my funeral
It only should be played on a funeral because it is a sad "song"
I need to save this for the next time in tripping
Fnf fans: damn this shit fire! 🔥🔥🔥
I don't understand what just happened, but I love it!
0:42 Schrodinger’s sort: It’s sorted and unsorted at the same time
0:04 BIG MONEY! BIG MONEY!
I'd like to know what these algorithms actually are, compared to the ones we know from school. Thought I'd find links or brief description in the description, but no. :(
Most of them you can look up...however, "hybrid sort" is kind of weird. I think it's a bunch of dual-pivot Quicksort passes, followed by using Timsort to exploit the large-scale order of the result.
I have no idea how I got here, I have no idea what is going on, and I can't look away. It's like a mathematical simulation of what I assume to be an acid trip in a data center
Most other algorithms: You want me to sort it? Okay, first I need to see what I am sorting, then I gotta compare this to this, gotta group these into groups, gotta sort each individual group, gotta merge the groups, gotta sort the groups again...
Gravity and Pidgeonhole: You want me to sort it? Okay, first I need to see what I am sorting. Then I sort. Alright, done!
I don't understand a single fuck of what's happening there but I loved it
For cocktail merge, it think it should start with 8 integers
Then sort using cocktail sort.
Then merge them by using cocktail sort.
Hybrid Sort scares me
FNF fans be like: Yo, this song is fire
this mak the breain tingle good
May I have a look at the source code for "Radix LSD In-Place" based on this? It seems to run at about the same time as the original one and it appears to be less memory-intensive for the fact that it is an in-place version, which is quite impressive.
I have been looking everywhere and the Wikipedia and some other sources implement the out-of-place ones. w0rthy also implemented an in-place version but it looks different from this.
Yeah, pastebin.com/SKgjz7mh
While this uses a SortArray object which is used with this visualizer, it's not too hard to convert it to a vector or int array.
Thank you for sharing the code. Oh, and happy Pi day!
It takes advantage of the number representation. Works great on homogeneous known distributions but scales poorly.
6infinity8, of course, that is why it has never been implemented for practical uses. It works great with integer types (and theoretically with floating-point formats). It may be an advantage for a programming language that sorts integers with its default algorithm, such as Java. But the use of it is very limited, indeed, compared to others.
@@sortingstuff6357How is that implementation of Radix LSD in-place? Is it not creating an additional array (vector) the same size as the input array?
3:54 when the metro leaves the station
1:00 3:30
latte101: When this is sorted, the world will end...
*10 seconds later*
*everyone has left the chat*
I have no idea what any of this means but I love it
3:54
Hey, that sounds really good!
4:00
huh? HEY!!!!!!!!!! You ruined my fun! |/
people help the people -birdy
3:40 - end The sounds of hell; part TWO!!! 😀😀😀😶🌫️
The hybrid sorting got the ping 1045ms
FeelsGoodMan Clap FeelsGoodMan Clap FeelsGoodMan Clap FeelsGoodMan Clap
I'm listening to this while doing homework and my mom is attempting to fix the smoke alarms, god have mercy on my hearing
2:17 sounds dope as fuck
hmm yes lets split the list into 4 parts and use cocktail shaker sort with the 4 segments and use merge sort once they are sorted and call this cocktail merge sort
Hybrid sort looks like Merge Sort and QuickSort combined.
The26 That's why it's hybrid.
All answers including this are correct☺☺☺☺☺☺☺☺☺☺☺
And also added Inserting sort.
“Which sorting algorithm should I use?”
Hybrid sort: Yes.
Cocktail Merge Sort brings up a question I’ve had since seeing Merge Sort for the first time: which algorithm is Merge Sort just a “divide and conquer” approach to?
Calling it "divide and conquer" of another algorithm is a bit of an oversimplification. What it really does it just split things in half over and over again until it can work on the scale of individual pairs of items, then it just has to sort each of those pairs (which is easy, you just figure out which comes first and swap them if they need to be swapped), and then work its way back up by merging the already-sorted pairs (which is easy since you only have to look at the first item in each, and you can do it in the reverse order you split them in half with to only have to look at the tops of two lists at once).
For people like me who checked the comments hoping they wouldn’t have to Google: Pancake Sort is so bad because the only operation it has is to reverse the entire list up to a certain point - like sticking a spatula into a stack of pancakes and flipping what’s above it over. That’s why you often see the tallest unsorted element at the very beginning for a split second - it put it there, and it’s about to flip the entire unsorted portion to put it in the right place.
GUYS I JUST DEVIDED 0
Block: Braille Patterns, U+2800 - U+28FF[3]
Plane: Basic Multilingual Plane, U+0000 - U+FFFF[3]
Script: Braille (Brai) [4]
Category: Other Symbol (So) [1]
Bidirectional Class: Left To Right (L) [1]
Combining Class: Not Reordered (0) [1]
Character is Mirrored: No [1]
HTML Entity:
⠀
⠀
UTF-8 Encoding: 0xE2 0xA0 0x80
UTF-16 Encoding: 0x2800
UTF-32 Encoding: 0x00002800 is the answer for 0 devided by 0
W h a t
Que
ⁿᵃⁿⁱ
anyone who's played bootleg programmes titled "180 games!" hardly fitted onto gameboy cartridges is not surprised by these weird glitchy noises, in the slightest.
especially games like balloon fight, that'd glitch ALLthe time
2:27 alert! alert!
pancake sort looks like a single parent walking around the house while their kids are at school and they’re cleaning the house
3:30 is the talented kid explaining how they „just do” stuff
What possessed me to listen to sorting algorithms for 4 minutes and five seconds
I don’t think that’s gravity sort, looked different in other videos. And pidgonhole sort is usually called counting sort
This video made me laugh
What the heck does Pancake Sort do???
Gravity and Pigeonhole are basically: "(glowing red eyes) IAM THE SORT!"
Woww the crystal castles comeback sounds good
This is actually a really cool vid! Obscure is interesting! If anyone can tell me how these work, I'd love to know! I'm not really into coding just yet-
I recommend looking up the videos online, try to find ones explaining it to the general viewer, rather than someone trying to implement it into some code.
@@joeybarela363 Thanks! :D
Mathematical algorithmic patterns experiencing a frequency sweep, creating these digital alien vibrations
Just play these sounds at night and someone might think a UFO is near
DROP YOUR GUN!
It's okay nigga! I got the 0:36
If only I knew what I was looking at so I could appreciate it more
2:08 9 year old me trying to figure out a multiplication problem
Why do I enjoy listening to this so much