Your voice sounds better ❤ Gnome reminded me of pigeon street. I like odd even, and others that maintain variety of pitch throughout... Alternate bitonic.basic in place merge. The actual sound for weave is nice. Identity crisis is obviously the best. Grail sounds like some radio data mode.
Grail takes you on a journey. It initially sounds like random noise (because it is). Then it shifts into an almost musical noise and finally shifts to a space laser battle.
The many worlds hypothesis is equivalent to the Copenhagen interpretation, which does not need to invoke parallel universes in exchange for observational decoherence; the trick to implementing bogosort in the Copenhagen interpretation is to make any state where the list is unsorted lead to a contradiction, therefore leaving only the sorted list as a possible output. So, doing exactly the same math but interpreting it differently, we save n!-1 universes from certain destruction
for some reason i find it super fucking funny that miracle sort doesnt do shit (because it’s waiting for a miracle) and because of that it doesnt even get shuffled identity crisis just comes in and sorts the array for it
I think rotate merge (18:54) is my favorite. I love all the algorithms that make the little rainbows, but the teleport looking stuff rm does is next level
My favorite is Insertion sort! 1) Binary insertion: It is the best at what it does (inserting into sorted list) 2) Shell sort: so satisfiing visually (The list troughout the whole range is gradually more and more sorted) 3) Basic form: very intuitive and easy to understand while being better performing out of the simplest ones. Even the code is very minimalistic and beautiful! for i = 0 to n: for j = 0 to i: if a[i] < a[j] swap(a[i], a[j])
The Baiai sort is an innovative sorting algorithm that incorporates attributes of both the Bubble Sort and the Insertion Sort. This unique approach makes it a hybrid sorting method, combining the strengths of both algorithms.
12:34 This is the FIRST time ever I've come across a sorting network that's actually visualized in a parallel setting. I'd like to see more concurrent algorithms visualized in this way
Some of these were created in the days ot tape drives. An interesting metric might be not just number of reads and writes, but how far the tape has to travel - measure the distance between consecutive read/writes and add them up. It would even be interesting to see this graphed over time.
Min heap: Just like heap sort but it puts the smallest at the first places then reverses it when all maxes have been excrated. Baiai: Bubble and Insertion combined
I know this probably is a sorting algorithm but i just now thought of it. Its starts at the left and if the bar directly on its right is too different in factors (hue,height,etc) it sends it to the far right and then keeps doing that until its sorted. And if theres any left it sorts it a few times
0:06 Selection Sort,1st Sort of Selection Sorts Family 0:26 Double Selection Sort,2nd Sort of Selection Sorts Family 0:37 Insertion Sort,1st Sort of Insertion Sorts Family 1:00 Binary Insertion Sort,2nd Sort of Insertion Sorts Family 1:14 Bubble Sort,1st Sort of Exchange Sorts Family 1:39 Cocktail Shaker Sort,2nd Sort of Exchange Sorts Family 2:01 Comb 🪮 Sort,3rd Sort of Exchange Sorts Family 2:21 Maximum Heap Sort,3rd Sort of Selection Sorts Family 2:43 Minimum Heap Sort,4th Sort of Selection Sorts Family 2:55 Shell 🐚 Sort,3rd Sort of Insertion Sorts Family 3:24 Quick Sort(Left/Right Pointers),4th Sort of Exchange Sorts Family 3:47 Merge Sort,1st Sort of Merge Sorts Family 4:15 Least Significant Digit Radix Sort(Base 4),1st Sort of Distribution Sorts Family 4:35 Least Significant Digit Radix Sort(Base 10),2nd Sort of Distribution Sorts Family 4:53 Most Significant Digit Radix Sort(Base 4),3rd Sort of Distribution Sorts Family 5:16 Most Significant Digit Radix Sort(Base 10),4th Sort of Distribution Sorts Family 5:33 Bucket 🪣 Sort(10 Buckets),5th Sort of Distribution Sorts Family 6:04 Bucket 🪣 Sort(10 Bucket Numbers),6th Sort of Distribution Sorts Family 6:19 Counting Sort,7th Sort of Distribution Sorts Family 6:33 Gravity Sort,8th Sort of Distribution Sorts Family 6:46 BOGO Sort,1st Sort of Impractical Sorts Family 7:08 Pancake 🥞 Sort,1st Sort of Misccelaneous Sorts Family 7:37 Cycle 🔁🔄🔃 Sort,5th Sort of Selection Sorts Family 8:05 Sandpaper Sort(aka Earthbound Sort),5th Sort of Exchange Sorts Family 8:28 Reverse Sandpaper Sort(or Reverse Earthbound Sort),6th Sort of Exchange Sorts Family 8:44 Odd-Even Sort,7th Sort of Exchange Sorts Family 9:08 Gnome Sort,8th Sort of Exchange Sorts Family 9:32 Baiai Sort,1st Sort of Hybrid Sorts Family 9:55 Circle ⭕️ Sort,9th Sort of Exchange Sorts Family 10:13 Patience Sort,4th Sort of Insertion Sorts Family 10:43 Strand Sort,2nd Sort of Merge Sorts Family 11:19 Iterative Bitonic Sort,1st Sort of Concurrent Sorts Family
Correction: Bogo sort n=12 MIGHT take several months, it can be anything from a few seconds to several years or longer depending on the rng algorithm used
why do none of the popular visualizations show more than one bucket? :argh: fyi, I made basav (bucket-aware sorting algorithm visualizer), but it's been unmaintainable and dead for years… I want to remake it properly one day, but I don't have time…
When I was in school, i barely passed the unit on sorting algorithms... If we'd has videos like this to help visualize, i might have done better 😂 My favorite visualizations where the algorithm is recursive and you can see that super clearly.
It would have been more intuitive to use low notes for the high values and vice versa. That's how musical instruments actually work: A small object makes a short wavelength, which creates a "high" note. A large object makes a long wavelength, which creates a "low" note.
I am trying to implement this in Touchdesigner using RGB noise, python script, and GLSL. Any ideas on where to start? I've got it working using the built in sorted() method
def selection_sort(data): """Sorts a list of data in ascending order using selection sort. Args: data: A list of sortable elements. Returns: A new list containing the sorted elements. """ length = len(data) for i in range(length - 1): min_index = i for j in range(i + 1, length): if data[j] < data[min_index]: min_index = j if i != min_index: data[i], data[min_index] = data[min_index], data[i] return data # Example usage my_data = [64, 25, 12, 22, 11] sorted_data = selection_sort(my_data.copy()) # Avoid modifying original list print(sorted_data) # Output: [11, 12, 22, 25, 64]
I've done this before a long time ago, but I figured now that there's a really good video showcasing all the major sorting algorithms that I'll do this again! So get ready for... Sorting Algorithms dumbed-down and explained by some random viewer whose only analyzing is done by looking at the visualizations! (and yes, I watched the explanations, I just thought this would be funny XD) NOTE: "This is the sorting algorithm talking." *This is me talking.* Selection Sort: "I search the unsorted list and place the lowest item where it belongs in the sorted list. I repeat this until the list is sorted." Double Selection Sort: "I do the same thing as Selection Sort except I also place the highest item where it belongs in the sorted list." Insertion Sort: "I look for the next item and place it in the current list. I repeat this until the list is sorted." Binary Insertion Sort: "I do the same thing as Insertion Sort except I'm more efficient in placing items in the current list." Bubble Sort: "I search the unsorted list and push the highest item I find to the end of the list. I repeat this until the list of sorted." Shaker Sort: "I do the same thing as Bubble Sort except I also push the lowest item to the beginning of the list." Comb Sort: "I search the unsorted list and slowly place the items where they belong until the list is eventually sorted." Heap Sort: *...The highest item magically teleports from the beginning to the end of the list...?* Min Heap Sort: *Now the lowest item teleports to the end of the list...? Isn't that the wrong way- oh, they reversed it.* Shell Sort: "I'm like Comb Sort but have five hands to place the items where they belong in the sorted list." Quick Sort: "I partition the list in half over and over and sort each section until the list is sorted." Merge Sort: "I merge two sets of items together using magic until the list is sorted." Radix LSD Sort (b = 4): *...What the hell is this...?* Radix LSD Sort (b = 10): *...Now the end result sorts the list in five sections I guess...?* Radix MSD Sort (b = 4): "Hehe, I'm secretly Quick Sort in disguise." Radix MSD Sort (b = 10): "Hehe, I'm secretly Quick Sort in disguise except I partition the list into five sections now." Bucket Sort (b = 10): "Fools, I partition the list into ten sections now!" Bucket Sort (b = n/10): "Hah, you think ten sections is good? Try thirty-eight!" Counting Sort: "One...two...done! Here's your sorted list!" Gravity Sort: "With the power of the non-existent gravity, all the items slowly fall into position!" Bogo Sort: "Oh, the list isn't sorted? Lemme just randomize it real quick...there it should be sorted now. ...Whaaat?! It's still not sorted?!" Pancake Sort: "I'm like Selection Sort except I do a bunch of unnecessary flips. I'm not called Pancake Sort for nothing!" Cycle Sort: "I cycle through the unsorted list over and over again as the items slowly get placed where they belong until the list is sorted." Exchange Sort v1: "I'm like Selection Sort except I make this really cool visualization as I try to search for the lowest item." Exchange Sort v2: "I do the same thing as the first Exchange Sort except the visualization is flipped so it's marginally more efficient." Odd Even Sort: "The lower items go to the left. The higher items go to the right. I repeat this until the list is sorted." Gnome Sort: "I do the same thing as Insertion Sort except I make a bunch of unnecessary checks." Baiai Sort: "I'm like Insertion Sort except I multitask by placing multiple items in the current list at the same time." Circle Sort: *...I think it's having a seizure trying to sort the list.* Patience Sort: *Oh cool, the items are getting pushed around as they get sorted.* Strand Sort: "I search the unsorted list to find the longest ascending list of items and merge it with the current list until the list is sorted." Bitonic Sort: "I'm like Merge Sort except I forgot to take my ADHD meds." Recursive Bitonic Sort: "Now I look even more like Merge Sort!" Alternate Bitonic Sort: "I like pyramids." Bitonic Sort w/ Parallel Processors: "I finally took my ADHD meds and I'm INSANE." Odd Even Network Sort: "I'm like Bitonic Sort except I'm neurotypical." Pairwise Network Sort: "Radix Sort! I'm your biggest fan!" Quick Sort LL: "I do the same thing as the first Quick Sort except I favor the left side." Dual Pivot Quick Sort: "I do the same thing as the first two Quick Sorts but better." Proportion Extend Sort: *...It's just Quick Sort.* Intro Sort: *This is so inefficient. Why would anyone ever use this?* Pattern Defeating Quick Sort: *...Well there's no patterns to be seen, so that kinda defeats the purpose.* Tim Sort: *...It's just Merge Sort. Why are we copying each other now?* Iterative Merge Sort v1: "I'm like Merge Sort except I'm iterative. It's in the dang name!" Iterative Merge Sort v2: "I do the same thing as the first Iterative Merge Sort but better." In Place Merge Sort: "I do the same thing as Merge Sort without any magic." Weave Sort: "I do the same thing as In Place Merge Sort but better...somewhat." Rotate Merge Sort: "I do the same thing as Iterative Merge Sort without any magic." Quad Sort: "I do the same thing as Rotate Merge Sort but better...somewhat." Weak Heap Sort: *...It looks the exact same as regular Heap Sort.* Ternary Heap Sort: *Why are we still copying each other?* Smooth Sort: *...I don't get it.* Poplar Sort: *I guess it's a better version of Smooth Sort?* In Place Radix MSD Sort (b = 4): "I do the same thing as Radix MSD Sort without any magic." Binary Quick Sort (b = 2): "I do the same thing as Quick Sort but better...somewhat." In Place Radix LSD (b = 4): "I do the same thing as Radix LSD Sort without any magic." American Flag (b = 128): *...Where's the American Flag?* Spread Sort (b = n/10): "I spread the items of the list evenly before sorting them." Sample Sort (b = n/10, s = 2): "I do the same thing as Spread Sort except I make a quick merge before spreading all the items. You could say I'm making a...sample- AHAHAHAHA SO FUNNY!" Proxmap (b = n/10): "I'm like Cycle Sort but better...somewhat." Sqrt Sort (Kuvi Version): "Shh, don't tell anyone but I'm not actually Sqrt Sort." Original Block Sort: *Oh hey, a decently efficient sort that improved on the previous one- wait, what the hell is going on in the left side? Witch magic?* Wiki Sort: *Yeah, real great sort, but that witch magic is scaring me.* Grail Sort: *Oh god, the witch magic is spreading...RUN!* Stooge Sort: "I'm somewhat like Merge Sort except I'm really inefficient and make a bunch of unnecessary checks." Slow Sort: "Alright, we got two halves of the list sorted, now where's the highest item again...?" Stalin Sort: "Lemme just do this and...here's your sorted list! ...What do you mean "you just deleted almost all of the items"?! You didn't specify that in the instructions!" Miracle Sort: "If we pray hard enough, a miracle will happen that'll sort this list. I just know it." Identity Crisis Sort: "I'm like Quick Sort except...no, I'm like Merge Sort except...what the hell am I...?" Quantum Bogo Sort: *Huh? Oh, it's just Bogo Sort again and- wait, what's happening?! NO, STOP-* [END] I hope you enjoyed reading through this! (and probably getting triggered a few times haha)
6:46 the bogo sort works by randomly shuffling the list until its fully sorted. This sorting algorithm is also known as the worst Edited: this sorting algorithm speed depends on the luck
Explanations: th-cam.com/video/h1Bi0granxM/w-d-xo.html
Which algorithm looks and sounds the coolest?
so many piano keys being slammed into my ears i like heap and comb tho
Your voice sounds better ❤ Gnome reminded me of pigeon street. I like odd even, and others that maintain variety of pitch throughout... Alternate bitonic.basic in place merge. The actual sound for weave is nice. Identity crisis is obviously the best. Grail sounds like some radio data mode.
shuffling
Def Bitonic w/ parallel processors
Grail takes you on a journey. It initially sounds like random noise (because it is). Then it shifts into an almost musical noise and finally shifts to a space laser battle.
There is a version of this video, in which quantum bogo sort actually sorted the list.
dont play with quantum bogo sort
The many worlds hypothesis is equivalent to the Copenhagen interpretation, which does not need to invoke parallel universes in exchange for observational decoherence; the trick to implementing bogosort in the Copenhagen interpretation is to make any state where the list is unsorted lead to a contradiction, therefore leaving only the sorted list as a possible output. So, doing exactly the same math but interpreting it differently, we save n!-1 universes from certain destruction
@@charlesmartin1972 Ah, I see you're a Multiverse Holocaust Denialist.
i feel like a mindless drooling baby watching those playdoh egg reveals
6:45 wake up babe new BogoSort type beat just dropped
"Still Bogo" by Dr. Bogo
I used the Stalin alghorithm to sort 85% of the problems in my company
Thanks!
Bro where did your lost data go
SOVIET USA war
for some reason i find it super fucking funny that miracle sort doesnt do shit (because it’s waiting for a miracle) and because of that it doesnt even get shuffled identity crisis just comes in and sorts the array for it
I mean they technically did get a miracle, they just didn’t sort it themselves
@@VibinSquad i guess that makes it bludger sort then
28:15 Miracld Sort
Ah, Miracle. The sorting algorithm of YandereDev.
I like that the instrument changes between sorts, they sound nicer than arrayV bip sound
I think rotate merge (18:54) is my favorite. I love all the algorithms that make the little rainbows, but the teleport looking stuff rm does is next level
I love how each sorting algorhithm made a different sound based on vibes
My favorite is Insertion sort!
1) Binary insertion: It is the best at what it does (inserting into sorted list)
2) Shell sort: so satisfiing visually (The list troughout the whole range is gradually more and more sorted)
3) Basic form: very intuitive and easy to understand while being better performing out of the simplest ones. Even the code is very minimalistic and beautiful!
for i = 0 to n:
for j = 0 to i:
if a[i] < a[j]
swap(a[i], a[j])
My ass was NOT expecting bitonic sort in parallel processors to go as sicko mode as it did
Just saw it too! Insane lol
please time stamp
@@randomcooldud12:30
This sounds like some sci fi shit
@@randomcooldud 12:20
70 algorithm, so wierd. I was expecting something random... maybe 37?
This is too deep
Veritasium moment
Alternate title: "When Kuvina meets Veritasium"
@@wyattstevens8574and we need vsauce, nilered and styropyro
Also backyard scientist
Best collab yet
@@temmie1662 VSauce be like, "37 is random... or is it?"
2:50 oh shit wrong way
*switches it back*
28:09 Confused the heck out of me at first, then I read the name
It's the most efficient sorting algorithm.
@Merlinistic Bitonic Paralel...
@@LukeCompositor Intelligent design sort...
@@LukeCompositor solution: delete cells 1 through to n-1
check n-1
check n
if n-1>n, flip cells
Supreme Soviet Stalin Sort
12:38 blink and you miss it (bitonic parallel)
bitonic parallel is probably also the flashiest algorithm in this video
And sounds so futuristic 😂
@@pranitroy7306bogo
1:02 performing a backwards long jump in super mario 64
I like the sound, it tickles my brain
My fav sound is the comb one
2:24 When a cartoon character falls:
True
screams of the damned
The Baiai sort is an innovative sorting algorithm that incorporates attributes of both the Bubble Sort and the Insertion Sort. This unique approach makes it a hybrid sorting method, combining the strengths of both algorithms.
RIP the universe
Yoooo when's this releasing on spotify
I like how the noises range from tippy tappy on a child's xylophone to menace on a piano to discordia itself lol.
You made a sort colors video that is impressively difficult to listen to. I love it
6:58 n=12 takes several months *on average*
keep gambling 🔥🔥🔥🗣🗣🗣
why is bogo so stupid i dont understand-
@@arsonzartz it re-assorts each line randomly until they're all in order, if they're not it restarts
@@roxtor999 ye i learned that later-
@arsonzartz cause n=6
this is equivalent to those baby sensory videos with the dancing fruit in the best way
i love that comb sounded like running your finger along real comb blades
If Mario made a sorting algorithm: 1:02
I get it!😂
Jump
It’s the sound, isn’t it
@@MS-yw3styes it is the jump sound
*Agreesive mario jump*
You are a gift to the world
12:34 This is the FIRST time ever I've come across a sorting network that's actually visualized in a parallel setting. I'd like to see more concurrent algorithms visualized in this way
Sick beats too.
I felt an impending sense of doom when I saw quantum bogosort was next...
so this is what non-existence feels like, huh?
29:01 Quantum Bogosort
Never thought this would help me preparing for a coding tournament but it actually did, now i know merge is faster than bubble, thx!
6:45 for bogo sort
giving pattern defeating quicksort a uniformly random list is just mean
I don't know how I got on the sorting algorithm part of YT, and I have very little idea what I'm looking at, but I can't stop watching.
The subtitles really helped in understanding everything
Some of these were created in the days ot tape drives. An interesting metric might be not just number of reads and writes, but how far the tape has to travel - measure the distance between consecutive read/writes and add them up. It would even be interesting to see this graphed over time.
stalin sort is wonderfully silly
2:16 collecting coins in Temple Run
New idea: Fraud sort
Step 1: count how large the list is
Step 2: delete the list and replace it with a preloaded sorted list of equal size
Min heap: Just like heap sort but it puts the smallest at the first places then reverses it when all maxes have been excrated. Baiai: Bubble and Insertion combined
I was waiting the entire video for Stalin sort. Was not disappointed
I know this probably is a sorting algorithm but i just now thought of it. Its starts at the left and if the bar directly on its right is too different in factors (hue,height,etc) it sends it to the far right and then keeps doing that until its sorted. And if theres any left it sorts it a few times
what is bro's beef with 70
It’s cool that you came up with an algorithm!
0:06 Selection Sort,1st Sort of Selection Sorts Family
0:26 Double Selection Sort,2nd Sort of Selection Sorts Family
0:37 Insertion Sort,1st Sort of Insertion Sorts Family
1:00 Binary Insertion Sort,2nd Sort of Insertion Sorts Family
1:14 Bubble Sort,1st Sort of Exchange Sorts Family
1:39 Cocktail Shaker Sort,2nd Sort of Exchange Sorts Family
2:01 Comb 🪮 Sort,3rd Sort of Exchange Sorts Family
2:21 Maximum Heap Sort,3rd Sort of Selection Sorts Family
2:43 Minimum Heap Sort,4th Sort of Selection Sorts Family
2:55 Shell 🐚 Sort,3rd Sort of Insertion Sorts Family
3:24 Quick Sort(Left/Right Pointers),4th Sort of Exchange Sorts Family
3:47 Merge Sort,1st Sort of Merge Sorts Family
4:15 Least Significant Digit Radix Sort(Base 4),1st Sort of Distribution Sorts Family
4:35 Least Significant Digit Radix Sort(Base 10),2nd Sort of Distribution Sorts Family
4:53 Most Significant Digit Radix Sort(Base 4),3rd Sort of Distribution Sorts Family
5:16 Most Significant Digit Radix Sort(Base 10),4th Sort of Distribution Sorts Family
5:33 Bucket 🪣 Sort(10 Buckets),5th Sort of Distribution Sorts Family
6:04 Bucket 🪣 Sort(10 Bucket Numbers),6th Sort of Distribution Sorts Family
6:19 Counting Sort,7th Sort of Distribution Sorts Family
6:33 Gravity Sort,8th Sort of Distribution Sorts Family
6:46 BOGO Sort,1st Sort of Impractical Sorts Family
7:08 Pancake 🥞 Sort,1st Sort of Misccelaneous Sorts Family
7:37 Cycle 🔁🔄🔃 Sort,5th Sort of Selection Sorts Family
8:05 Sandpaper Sort(aka Earthbound Sort),5th Sort of Exchange Sorts Family
8:28 Reverse Sandpaper Sort(or Reverse Earthbound Sort),6th Sort of Exchange Sorts Family
8:44 Odd-Even Sort,7th Sort of Exchange Sorts Family
9:08 Gnome Sort,8th Sort of Exchange Sorts Family
9:32 Baiai Sort,1st Sort of Hybrid Sorts Family
9:55 Circle ⭕️ Sort,9th Sort of Exchange Sorts Family
10:13 Patience Sort,4th Sort of Insertion Sorts Family
10:43 Strand Sort,2nd Sort of Merge Sorts Family
11:19 Iterative Bitonic Sort,1st Sort of Concurrent Sorts Family
Correction: Bogo sort n=12 MIGHT take several months, it can be anything from a few seconds to several years or longer depending on the rng algorithm used
"Insertion" is a banger.
Thank youuuuu ❤❤❤ So soothing!!!
Radix LSD has always sounded like a starship energizing for takeoff, especially on the last few iterations.
why do none of the popular visualizations show more than one bucket? :argh:
fyi, I made basav (bucket-aware sorting algorithm visualizer), but it's been unmaintainable and dead for years… I want to remake it properly one day, but I don't have time…
6:55 "n=12 takes several months" BUT IT COULD TAKE NO TIME AT ALL!
Miracle be like: yeah, i looked at it. looks unsorted. have a great day.
1:28 bwoo bwooo bwoooo
Pairwise network, the Radux ones, and Weave definitely look the coolest.
1:02 why does this sound familiar
I ❤️ your videos
Shell Sort and Selection Sort is two of my favorite algorithms!But Shell Sort is my most favorite algorithm.I used Selection Sort in my school.
You have inspired me. Thank you,
fellow shell sort liker! High five!!
4:25 Not true. Radix sorts can also sort alphabetical lists
Shuffling gotta be my favorite out of them :D
New Kuvina video!!!
When I was in school, i barely passed the unit on sorting algorithms... If we'd has videos like this to help visualize, i might have done better 😂 My favorite visualizations where the algorithm is recursive and you can see that super clearly.
Why do most visualisations not show auxiliary memory?
My sense of humor is broken to the point of no return I laughed at the 2:24 heap sorting's sound
I agree, shell sort is a classic! I also enjoy stooge sort
It would have been more intuitive to use low notes for the high values and vice versa.
That's how musical instruments actually work:
A small object makes a short wavelength, which creates a "high" note.
A large object makes a long wavelength, which creates a "low" note.
🤔 yes but I feel like most people would expect higher up things to the right to be higher notes, like a piano
This is what I'm going to sleep to today
5:37 so cool sounding also why is n=SPECIFACALLY 384
Bogo sort is sort what just mixing in random way and stopping when lines are sorted
Parallel bitonic sort:
1. Sort
2. Done
BOGO SORT BABY LETS GOOOO
6:57 it was sorted, but it still continued...
(I repeatedly paused the video several times to notice this 😭)
I am trying to implement this in Touchdesigner using RGB noise, python script, and GLSL. Any ideas on where to start? I've got it working using the built in sorted() method
my ears are secreting some weird red substance right now
Blood
Why didn’t original block ever use the basket?
bogo n=512
(20 years later)
hey what is these colorful retangles changing position?
def selection_sort(data):
"""Sorts a list of data in ascending order using selection sort.
Args:
data: A list of sortable elements.
Returns:
A new list containing the sorted elements.
"""
length = len(data)
for i in range(length - 1):
min_index = i
for j in range(i + 1, length):
if data[j] < data[min_index]:
min_index = j
if i != min_index:
data[i], data[min_index] = data[min_index], data[i]
return data
# Example usage
my_data = [64, 25, 12, 22, 11]
sorted_data = selection_sort(my_data.copy()) # Avoid modifying original list
print(sorted_data) # Output: [11, 12, 22, 25, 64]
Quick sounds good
I've done this before a long time ago, but I figured now that there's a really good video showcasing all the major sorting algorithms that I'll do this again! So get ready for...
Sorting Algorithms dumbed-down and explained by some random viewer whose only analyzing is done by looking at the visualizations! (and yes, I watched the explanations, I just thought this would be funny XD)
NOTE: "This is the sorting algorithm talking." *This is me talking.*
Selection Sort: "I search the unsorted list and place the lowest item where it belongs in the sorted list. I repeat this until the list is sorted."
Double Selection Sort: "I do the same thing as Selection Sort except I also place the highest item where it belongs in the sorted list."
Insertion Sort: "I look for the next item and place it in the current list. I repeat this until the list is sorted."
Binary Insertion Sort: "I do the same thing as Insertion Sort except I'm more efficient in placing items in the current list."
Bubble Sort: "I search the unsorted list and push the highest item I find to the end of the list. I repeat this until the list of sorted."
Shaker Sort: "I do the same thing as Bubble Sort except I also push the lowest item to the beginning of the list."
Comb Sort: "I search the unsorted list and slowly place the items where they belong until the list is eventually sorted."
Heap Sort: *...The highest item magically teleports from the beginning to the end of the list...?*
Min Heap Sort: *Now the lowest item teleports to the end of the list...? Isn't that the wrong way- oh, they reversed it.*
Shell Sort: "I'm like Comb Sort but have five hands to place the items where they belong in the sorted list."
Quick Sort: "I partition the list in half over and over and sort each section until the list is sorted."
Merge Sort: "I merge two sets of items together using magic until the list is sorted."
Radix LSD Sort (b = 4): *...What the hell is this...?*
Radix LSD Sort (b = 10): *...Now the end result sorts the list in five sections I guess...?*
Radix MSD Sort (b = 4): "Hehe, I'm secretly Quick Sort in disguise."
Radix MSD Sort (b = 10): "Hehe, I'm secretly Quick Sort in disguise except I partition the list into five sections now."
Bucket Sort (b = 10): "Fools, I partition the list into ten sections now!"
Bucket Sort (b = n/10): "Hah, you think ten sections is good? Try thirty-eight!"
Counting Sort: "One...two...done! Here's your sorted list!"
Gravity Sort: "With the power of the non-existent gravity, all the items slowly fall into position!"
Bogo Sort: "Oh, the list isn't sorted? Lemme just randomize it real quick...there it should be sorted now. ...Whaaat?! It's still not sorted?!"
Pancake Sort: "I'm like Selection Sort except I do a bunch of unnecessary flips. I'm not called Pancake Sort for nothing!"
Cycle Sort: "I cycle through the unsorted list over and over again as the items slowly get placed where they belong until the list is sorted."
Exchange Sort v1: "I'm like Selection Sort except I make this really cool visualization as I try to search for the lowest item."
Exchange Sort v2: "I do the same thing as the first Exchange Sort except the visualization is flipped so it's marginally more efficient."
Odd Even Sort: "The lower items go to the left. The higher items go to the right. I repeat this until the list is sorted."
Gnome Sort: "I do the same thing as Insertion Sort except I make a bunch of unnecessary checks."
Baiai Sort: "I'm like Insertion Sort except I multitask by placing multiple items in the current list at the same time."
Circle Sort: *...I think it's having a seizure trying to sort the list.*
Patience Sort: *Oh cool, the items are getting pushed around as they get sorted.*
Strand Sort: "I search the unsorted list to find the longest ascending list of items and merge it with the current list until the list is sorted."
Bitonic Sort: "I'm like Merge Sort except I forgot to take my ADHD meds."
Recursive Bitonic Sort: "Now I look even more like Merge Sort!"
Alternate Bitonic Sort: "I like pyramids."
Bitonic Sort w/ Parallel Processors: "I finally took my ADHD meds and I'm INSANE."
Odd Even Network Sort: "I'm like Bitonic Sort except I'm neurotypical."
Pairwise Network Sort: "Radix Sort! I'm your biggest fan!"
Quick Sort LL: "I do the same thing as the first Quick Sort except I favor the left side."
Dual Pivot Quick Sort: "I do the same thing as the first two Quick Sorts but better."
Proportion Extend Sort: *...It's just Quick Sort.*
Intro Sort: *This is so inefficient. Why would anyone ever use this?*
Pattern Defeating Quick Sort: *...Well there's no patterns to be seen, so that kinda defeats the purpose.*
Tim Sort: *...It's just Merge Sort. Why are we copying each other now?*
Iterative Merge Sort v1: "I'm like Merge Sort except I'm iterative. It's in the dang name!"
Iterative Merge Sort v2: "I do the same thing as the first Iterative Merge Sort but better."
In Place Merge Sort: "I do the same thing as Merge Sort without any magic."
Weave Sort: "I do the same thing as In Place Merge Sort but better...somewhat."
Rotate Merge Sort: "I do the same thing as Iterative Merge Sort without any magic."
Quad Sort: "I do the same thing as Rotate Merge Sort but better...somewhat."
Weak Heap Sort: *...It looks the exact same as regular Heap Sort.*
Ternary Heap Sort: *Why are we still copying each other?*
Smooth Sort: *...I don't get it.*
Poplar Sort: *I guess it's a better version of Smooth Sort?*
In Place Radix MSD Sort (b = 4): "I do the same thing as Radix MSD Sort without any magic."
Binary Quick Sort (b = 2): "I do the same thing as Quick Sort but better...somewhat."
In Place Radix LSD (b = 4): "I do the same thing as Radix LSD Sort without any magic."
American Flag (b = 128): *...Where's the American Flag?*
Spread Sort (b = n/10): "I spread the items of the list evenly before sorting them."
Sample Sort (b = n/10, s = 2): "I do the same thing as Spread Sort except I make a quick merge before spreading all the items. You could say I'm making a...sample- AHAHAHAHA SO FUNNY!"
Proxmap (b = n/10): "I'm like Cycle Sort but better...somewhat."
Sqrt Sort (Kuvi Version): "Shh, don't tell anyone but I'm not actually Sqrt Sort."
Original Block Sort: *Oh hey, a decently efficient sort that improved on the previous one- wait, what the hell is going on in the left side? Witch magic?*
Wiki Sort: *Yeah, real great sort, but that witch magic is scaring me.*
Grail Sort: *Oh god, the witch magic is spreading...RUN!*
Stooge Sort: "I'm somewhat like Merge Sort except I'm really inefficient and make a bunch of unnecessary checks."
Slow Sort: "Alright, we got two halves of the list sorted, now where's the highest item again...?"
Stalin Sort: "Lemme just do this and...here's your sorted list! ...What do you mean "you just deleted almost all of the items"?! You didn't specify that in the instructions!"
Miracle Sort: "If we pray hard enough, a miracle will happen that'll sort this list. I just know it."
Identity Crisis Sort: "I'm like Quick Sort except...no, I'm like Merge Sort except...what the hell am I...?"
Quantum Bogo Sort: *Huh? Oh, it's just Bogo Sort again and- wait, what's happening?! NO, STOP-*
[END]
I hope you enjoyed reading through this! (and probably getting triggered a few times haha)
6:46 the bogo sort works by randomly shuffling the list until its fully sorted. This sorting algorithm is also known as the worst
Edited: this sorting algorithm speed depends on the luck
insertion looks like a half-sort stack of lines eating up the other lines (idk how to explain it it's just so cool 🤩)
I could sleep to this
2:05 different instrument?
It’s the sound of a comb…
BOGO sort, my beloved
Bogosort is the s p e c i a l child of the family
my favorite sorting algorithm is counting!!!
Does Bogo just go through every possible combination of the values?
Make one where all run at the same time and the color of the line in a position shows the media of acuracy of the respective line to that position
2:01
2:44 Name Of The Instruments?
the shuffle sort the best
2:24 is a UFO landing
I wonder what the best algorithm is for data storage
Anything that doesn't use auxiliary arrays
2:50 512 BARS (n 512)? lol
What a bop
I also like shell sort & insertion sort
Alright. Enby gang, assemble.
No. 🤡🤡🤡
It would be cool if the runtimes were included... so I could hone my intuition about runtime
My ass was NOT expecting bitonic sort in parallel processors to go as it did
0:40 Insertion is satisfying