Imagine stargazing late at night in a rural area with no light pollution and you just start seeing the stars organizing themselves into a diagonal line across the sky
@@CreaturaVioleta - Selection Sort. It looks pretty quick here in this video, but Wikipedia says it's inefficient with large lists. It's a very intuitive algorithm though.
Selection sort is soooo bad. But very intuitive, especially if you're starting out. I think bubble sort and selection sort are the two most intuitive sorts to program/think of.
It, like several of the other algorithms, does all of its work in scratch space outside the array it's sorting, and then simply copies the sorted array from scratch space into the original array. Visualizing the sort is fairly pointless.
2:24 Windows_hardware_insertion.wav 12:37 Windows_hardware_remove.wav 12:49 Windows_hardware_insertion.wav 13:22 Windows_hardware_remove.wav 13:24 Windows_hardware_insertion.wav 15:28 Windows_system_generic.wav 28:57 Windows_hardware_remove.wav dude, what was up with your computer?
@@sethesteem Most of these can sort arbitrary data, including lists of names, so long as you have a function that compares any two elements and tells you which should come first. Those are called comparison sorts. Some algorithms, however, use some properties of the underlying data and thus don't work for arbitrary data. The various radix sort variations, for example, only work on integers. You can have more complicated data, mind you, but you are still only sorting by an integer. As an example, imagine you have a digital representation of a phone book. You could use radix sort to sort all entries by their telephone number, but not by name.
Or even visualize the memory/buffer used. This can be best seen at 9:13. A single passed and everything is instantly sorted. Looks like it got sorted off site and copied in.
This is satisfying. Also I wish to write a sortimg algorithm that works in logn complexity. I know for a fact some sorting algorithms are taking more tham than it is shown here.
Lets be honest. Wiki Merge, Grail Gravity, Batcher's Bitonic sort all looks cool. Wiki and grail looks like its from a retro old video game from an arcade. And i like Batcher's Bitonic patterns.
Almost every fucking sort: _Around 10k comparisons and array accesses, while sorting 2k numbers_ Bogo sort: _Sorts 10 goddamn numbers, while having shit of a ton comparisons and array accesses_
Windows notification at 2:24, thought it was my laptop, until I realized I’m on my phone listening through noise cancelling headphones that I haven’t paired to my laptop, also my laptop is off
Slow sort and silly sort took the exact same number of comparisons! I wonder if that's always the case for a fixed quantity of numbers to sort... If not, what a coincidence!
Join our community Discord! discord.com/invite/2xGkKC2
No
@@comment2925 🤬🤬🤬
Imagine stargazing late at night in a rural area with no light pollution and you just start seeing the stars organizing themselves into a diagonal line across the sky
LMAO
time to call the ambulance on yourself at that point
@@victorfunnyman only for them to say everyone else sees it too
Strange, but satisfying.
god be sorting those stars
Panic attack
When you only have to sort 10 numbers.
Bogo sort: *I am speed*
negative
@@jakubsebek Sort 10 numbers. In base 2.
Meanwhile: MAKES 48 QUADRILLION COMPARISONS
Time stamp plz
@@that_one_idiot9369 30:12
That awkward moment, when you realize the sorting algorithm you thought you came up with already existed, and it's one of the worst.
Which one?
@@CreaturaVioleta - Selection Sort. It looks pretty quick here in this video, but Wikipedia says it's inefficient with large lists. It's a very intuitive algorithm though.
Selection sort is soooo bad. But very intuitive, especially if you're starting out. I think bubble sort and selection sort are the two most intuitive sorts to program/think of.
i actually thought it was the bogo sort lmao
D-Frame wtf i also thought i invented it (i didn't know what selection was)
0:33 Sewing up the space-time rift
Said the KSP guy
The stars are aligning
(Btw, 100% stolen comment)
2:24 connects
12:37 disconnects
12:49 connects
13:22 disconnects and connects
28:57 disconnects
Remember to turn off Windows sounds when you make your screen captures, kids!
XD true
(i noticed just 1 and i was confused that am i halutinating.
@@lilwyvern4 and your discord spyware ;)
Lmaoo
He has a USB port with dirt in it lol. Shove a usb device in all the slots 5 or 6 times and it will stop :P
05:16 I want whatever Wikisort is smoking.
Steph Escobar You mean whatever its snorting?
Steph Escobar How about 17:27 ?
no it actually say smoking.
rip me if i get woooooshed :(
TheSmartOne wikisnort
Wikiweed
oh god
the stars are aligning
Get out
👉🚪
b o i
d a m n
lol
Best sort:
while(!sorted)
shuffle()
Yeah, it's actually the last one
Yeah, that sounds like pogo
Welcome to BogoSort my friend, It's the sorting equivalent of repeatedly hoping for miracles.
Nice
le penguin approves
9:12
wtf this algorithm is doing!!
9:28 oh!!....ok
It, like several of the other algorithms, does all of its work in scratch space outside the array it's sorting, and then simply copies the sorted array from scratch space into the original array. Visualizing the sort is fairly pointless.
did you see this one?
Counting Sort 16:39
@@user-fe9pz9wo5b yeah, counting sort is a funny one. ua-cam.com/video/7zuGmKfUt7s/v-deo.html
I love how the auto generated subtitles just say "[Music]"...
What else would you call the LSD sorts?
Hooman music intensified
"Theyre groovin"
What? They're entirely correct.
YT execs: what the hell do we call this?
YT Intern: music duh
YT execs: ...Well uh music it is just throw that somewhere in the subtitles...
Me watching slow sort at 24:13: "This doesn't seem all that slow, seems to be a pretty good spee---- oh."
114million comparisons to sort 200 numbers... wow
@@lckrgl it's bad when you see they had to lower the number
2:24 Windows_hardware_insertion.wav
12:37 Windows_hardware_remove.wav
12:49 Windows_hardware_insertion.wav
13:22 Windows_hardware_remove.wav
13:24 Windows_hardware_insertion.wav
15:28 Windows_system_generic.wav
28:57 Windows_hardware_remove.wav
dude, what was up with your computer?
Holy fuck I thought I was the only one
@@captainploo haha
I think his computer has dementia
gotta sort these sounds somehow
🤓🤓🤓🤓🤓🤓
2:24
When you plug in your usb
12:37
When you unplug your usb
h h
Is your sound on?
@@rrgdffgh you can hear the windows 10 usb sounds in the background
Btw are you a Mac user?
@@ThomasFarquhar2 I am but i know you wouldnt care.
I unlocked my phone right around 2:24 and freaked out!! (Was watching on my pc, btw)
@@northwood8089 I do care because I was about to go into a paragraph explanation of the usb sounds to explain it but I know you didn’t ask
16:17 this gives me anxiety
Witchcraft
Idk why it is so creepy
I will now select my sorting algorithms based on how cool they sound in the visualisation. :D
go for bogo sort man its the best
doot doot doot doot doot doot doot
Bozo sort
Bogo sort 100%
The comb sort looks pretty cool even if doesn't sounds the best
16:21 now this is real gravity sort
ʰᵃʰᵃ ᵍʳᵃᵛⁱᵗʸʸʸʸ
@@strawberrycoolatta bruh
it go up into line woo
Except gravity decided to not exist so antimatter came as a substitute.
not gonna lie if the news had reported this as an alien transmission i would have believed it
Timestamps:
Bubble Sort 0:06
Cocktail Shaker Sort 0:30
Gnome Sort 0:45
Optimized Gnome Sort 0:55
Odd-Even Sort 1:05
Selection Sort 1:27
Double Selection Sort 1:35
Insertion Sort 1:43
Binary Insertion Sort 2:01
Comb Sort 2:19
Shell Sort 2:51
Merge Sort 3:08
Binary Merge Sort 3:29
Weave Merge Sort 3:50
TimSort 4:25
Merge Sort In-Place 4:50
WikiSort 5:16
GrailSort 6:04
Quick Sort 6:40
Stable Quick Sort 6:57
Dual Pivot Quick Sort 7:20
Max Heap Sort 7:40
Min Heap Sort 8:00
Weak Heap Sort 8:20
Ternary Heap Sort 8:36
Smooth Sort 8:50
Tournament Sort 9:12
Cycle Sort 9:32
Introsort 10:40
Quick Shell Sort 10:54
Insert/Bottom-Up Merge 11:07
Batcher's Odd-Even Mergesort 11:29
Batcher's Bitonic Sort 12:30
Pancake Sort 14:20
Patience Sort 16:04
Gravity Sort 16:17
Counting Sort 16:39
Pigeonhole Sort 16:47
Radix LSD Sort (Base 4) 16:54
American Flag Sort (128 Buckets) 17:14
Radix LSD In-Place Sort (Base 10) 17:27
Radix LSD In-Place Sort (Base 2) 17:55
Radix MSD Sort (Base 4) 18:41
Radix MSD Sort (Base 2) 18:58
Shatter Sort 19:25
Simple Shatter Sort 19:41
Flash Sort 19:48
Time Sort (Mul 4) + Insertion Sort 19:59
Stooge Sort 20:13
Bad Sort 21:07
Silly Sort 21:55
Slow Sort 24:13
Less Bogo Sort 26:48
Cocktail Bogo Sort 28:27
Bogo Sort 30:14
Why?
(Impressed noises)
careful guys he's a hero
you forgot windows notification 2:24
Ohohooohhoo ohaahahhahah youve been gnomed!
what you came here for 17:27
Yer god damn right i did
lol, a sorting video meme
I came for that and gravity sort.
LSD definitely is correct
Ave Radix!
I like it. This sounds like 100 people playing Pac Man arcade machines at the same time.
Esspecially at 14:00
instantnoob ᶜᵒʳʳᵉᶜᵗ
2:26 looks like a realistic scatter plot
16:17 gravity sort is interesting
when you find the Earth is a reactangle.
ʷᵒⁿᵈᵉʳᶠᵘˡ
ᵘˢⁱⁿᵍ ˢᵗʸˡⁱˢʰ ᵗᵉˣᵗ ᵇᵗʷ
It's like when you're trying to sort your books in bookshelves, and then you just "i don't give a fuck about it" and permute the bookshelves
Ah yes, give me my 114 million comparisons for silly sort and slow sort.
and the 11 million array accesses for some radix sorts
Which one
@@epicgangnamstyle8783 lsd base 10 and lsd base 2. not sure tho
0:46 I'm a Gnome Sort, and you've been.. Gnomed (sorted)!
HELLO THERE ME OLD CHUM
2:24 I wonder what about the sorting algorithm made it make that sound.... truly mesmerizing indeed.
it compares at swaps elements at decreasing gap sizes
@@the_cheese_cultist windows sounds are quite a peculiar instance of sorting
Tournament sort is like "step 2: draw the rest of the fucking owl"
Other sort, like thousands of dots
Bogoshort:
*B O G O S H O R T*
*_B O G O S H O R T_*
@@nunsense9489 aww you copied me
@@ImGamingNow2010 aw nuts
@@nunsense9489 but it's ok =)
is bogo sort just randomly shuffling the array?
I don't understand how any of these work, or what their purpose are, but I watched them anyway because they look cool
These algorithms exist for the purpose of sorting numbers.
ˢᵃᵐᵉ ˡᵒˡ
@@varikvalefor3773 can they sort lists of names?
@@a.s8897 expand on that?
@@sethesteem
Most of these can sort arbitrary data, including lists of names, so long as you have a function that compares any two elements and tells you which should come first. Those are called comparison sorts.
Some algorithms, however, use some properties of the underlying data and thus don't work for arbitrary data. The various radix sort variations, for example, only work on integers. You can have more complicated data, mind you, but you are still only sorting by an integer. As an example, imagine you have a digital representation of a phone book. You could use radix sort to sort all entries by their telephone number, but not by name.
17:55 reminds me of the 2001 A Space Odyssey hyperspace scene.
That pigeonhole sort is flexing on us all
I like this way of visualizing cocktail shaker
And comb sort, they look really nice on this
I like these better, makes more sense. X = list position, Y = Value :)
I don't even know what this is but I like it
its the male fantasy
あなたはもう死んでいます Men only want one thing and it’s disgusting
methods to sort stuff
@@gamercat4764
Makes sense
Counting sort 16:40
vs pigeonhole sort 16:47
vs tournament sort 9:12
Don't forget Flash Sort 19:48
Thank you for making this video, a scatter plot is a much easier way to help visualize the differences of how these sorts work, at least for me.
1.5 million comparisons and 18 million array accesses to sort 10 numbers. The sort to rule them all
2:24 I love the windows sound
30:13 feels like some tune on old CN's cartoon
radix bass 10 breaking the fundamentals of the universe as usual
THESE VIDEOS NEED MEMORY CONSUMPTION.
Or even visualize the memory/buffer used. This can be best seen at 9:13. A single passed and everything is instantly sorted. Looks like it got sorted off site and copied in.
Next batch of videos will show writes to scratch arrays.
What is the method of determining which sound frequency to play for each sort operation?
It's based on how high the number being sorted is in the whole set.
@@Musicombo very cool
This is satisfying. Also I wish to write a sortimg algorithm that works in logn complexity. I know for a fact some sorting algorithms are taking more tham than it is shown here.
Spider-man: “Mr. Stark, I don’t feel so good.”
*Stark pulls up his computer*
Stark: “Don’t worry this computer will merge you back together”
Computer: bogosort
Just imagine looking up at the night sky and all the sudden you just here the shuffling sound and all the sudden the stars just get sorted
Lets be honest. Wiki Merge, Grail Gravity, Batcher's Bitonic sort all looks cool. Wiki and grail looks like its from a retro old video game from an arcade. And i like Batcher's Bitonic patterns.
17:27 thank me soon
21:55 when you are trying the increase the temperature of shower
Oh dear me I almost forgot my nightly tradition of watching a sorting video because for some reason it pops up in my recommended feed
I'm glad you included Bogo sort, the best of all!
all hail bogo sort
When's the video on shuffling algorithms?
16:20 *what*
*WHAT*
When you try out every Windows Movie Maker transition.
Wikisort was really fun to watch!
12:37 Did Somebody plug out a usb cable?
I need to look into gravity sort, it looks so good
gotta love random windows notification sounds
The selection sort was like "okay okay mhm I think I know what we can do (presses Ctrl+Z) done!"
i find it funny how slow sort as 114 million comparisons with only 200 thingies
cocktail sort is me trying to close the zipper on an overstuffed bag
16:48 THE BEAST IS HERE!!!!!
For how slow they are, I think even Bogo sorts would clean my room faster than I could.
gravity and counting sort was fucking satisfying
I can just feel the brain cells in my head dying as I watch this video.
Is there a reason you change the amount of numbers being sorted?
How long do comparisons and array accesses take?
Depends on the data you're sorting and how fast your computer is! Keep in mind these animations are slowed down.
6:07 - Dial Up Internet’s origin
Does low array access and comparison means better sort or efficient algorithm?
Essentially yes. For a sorting algo you want to minimize the amount of operations done to get a sorted list
@@NYgasman8 Also sometimes you want to have least amount of comparisons, even if it means more array accesses or the other way around.
It actually depends on the computer you're using. Sometimes reads are much faster than writes, and vice versa.
Listen to this while sleeping and working out
2:24 A removable device has been plugged in.
what am i doing with my life
my brain gets inverted everytime I watch these videos
Bogo sort needs to do 1,577,003 comparisons to sort 10 numbers? seems effective!
"Bogo" methods are a joke from "The Hitchhiker's Guide to the Galaxy"
it was just unlucky but if everything goes right, it is the fastest sorting algorithm out there.
if i recall correctly, it randomizes the position of everything until it's correct.
For a more accurate comparison, each sorting algorithm should start with the same shuffled list, not regenerated each time.
True. Besides the super slow ones ofc.
Will be working on that in the future!
Less bogo sort: "ONE OF THESE HAS TO GOD DAMN FIT!"
Very relaxing. ASMR for programmers.
Almost every fucking sort:
_Around 10k comparisons and array accesses, while sorting 2k numbers_
Bogo sort:
_Sorts 10 goddamn numbers, while having shit of a ton comparisons and array accesses_
Gonna go play Missile Command, this is over my head.
Say, whippersnapper, is this that hyperpop I've heard so much about?
Quick Shell Sort (Introsort with Shellsort)'s the type of people that sort in WalMart
These sound effects really remind me an NES game called "The three eyed one"
Mitsume ga Tooru?
Windows notification at 2:24, thought it was my laptop, until I realized I’m on my phone listening through noise cancelling headphones that I haven’t paired to my laptop, also my laptop is off
I know nothing about these. All I know is the bloop noises are cool.
I don’t know about you, but I’m seeing lines of cocaine
0:35 “feel good”
I’m a g-nome and you’ve been gnome sorted.
I have algorithm exam tomorrow ,this isn't helping .
Silly sort: “HA HA! Comparisons go BRRRRR!”
every sorting algorithm video needs bogo sort in the end
Flashsort is literally cheating lmao
I have no idea about what i'm watching
But it looks cool
Зачем я смотрю это?
2:24 Comb sort casually plugging in an usb stick
НИЧЁ НЕ ПОНЯЛ НО БЫЛО ИНТЕРЕСНО
Кто руский и тя сюда закинуло савь лайк
Slow sort and silly sort took the exact same number of comparisons! I wonder if that's always the case for a fixed quantity of numbers to sort... If not, what a coincidence!
>windows 10
Whenever I see dumb sorting methods, I think of the video games that piss off the AVGN with bad programming, bad ideas, and bad designs
2:23 USB Insertion sort
Dots: having fun
Me: bored as hell 😄