twitter.com/kuvina_4

I propose what I have heard referred to as "Stalin Sort": in O(n) remove any element which would cause the array to be unsorted. Unlike most sorting algorithms it doesn't preserve the contents of an array, but the result is indeed sorted.

My favorite sorting algorithm is "don't sort". Its where you figure out a way to solve your problem without sorting the list

We need to have Quantum Bogosort in the next one; it's too good of a joke algorithm to not include. Great video! :D

I think my favorite sorting algorithm is Miracle Sort. The steps are as follows: Check if the array is sorted. If not, check if the array is sorted. Repeat until sorted.

It's like the fourth time I rewatch that series, seriously this is the best resource to intermediary understanding of sorting.

Pattern defeating quicksort. Also if you're looking for "joke" ones: sleepsort. It'd may be interesting to go into algorithms designed with L1/L2 cache and branches/branchless in mind.

Commenting for the algorithm!

I come here to learn more about the radix sort, but end up watching all of the video. It is very interesting, thank you for making this

In Bogo Sort, instead of permuting the elements randomly, you could just permute the elements sequencially (think of permuting the indexes in lexicographical order, then checking if the reordering sorts the list). It is still O(x!), but at least is guaranteed to sort in finite time.

with all this knowledge i learned that the optimal sorting algorithem for all these animations is simply returning list(range(n)) since after assuming so many wonderful things (n uniform whole numbers between 1 and n) you already know the answer

That was a great explanation of big O notation, which doesn't make it sound illogical!

wow this video was super interesting! I somewhat recently programmed an application that sorted tiles in a 2D grid, and coding a fair amount of algorithms made me feel like I at least had a somewhat good grasp of how everything worked, but seeing this video I was really surprised at how deep the subject is, and how much I was missing! Amazing video!

I put this video knowing it would knock me out, worked like a charm. When I woke up, I re-watched the entire thing because it’s was such an interesting video

The world needs more UKpostsrs like you and less UKpostsrs of the kind you don't even want to ever find.

Binary insertion is actually like one of the if not the best way to sort physical objects, because the reason it is slowed down is shifting is O(n), but with real objects, you can shift everything at once for O(1), like in sorting cards you look for the right spot to put a card and then just stick it in there.

I'm literally playing a programming game right now and I'm thinking which sorting algorithm is the easiest to implement. It could never be a better timing for this video to come out lol. Apart from that, probably good thing to refresh memory and likely learn something new so you are instantly getting a watch time from me 👀

Oh my gosh, I was just getting recommended a bunch of sorting algorithm ASMR(?) videos and was trying to find something to explain each of the sorting algorithms, but none were really helping me. Haven't watched the video yet, but you've done such a good job explaining other complex topics, that I'm pretty sure this one will be of great help to me.

20:08 You really thought you could sneak that in there and have nobody notice

I look forward to the next part! There's another algorithm I'm not sure is in the end list (since I don't remember the name), but it had to do with a _very particular_ sort of memory device that was able to use chains of charge pump cells to be able to rapidly interleave and shuffle lists together. The algorithm wasn't particularly good asymptotically, but the amount of silicon gate area required for each cell was just _tiny_ and the device could be run at clock speeds fast enough to more than keep up in practical terms.

This is an amazing video, it's like those "sorting algorithms visualized" videos, but with a concise explanation of how each one works. Thank you, it really helped me understand them.

The space/time issue was a huge one for me when I did embedded programming. I used to write code for things as slow as 8mhz 8-bit hardware, with a few kb to a few hundred kb of ram. Merge sort was the usual candidate, but there were actually times that we would say stability be damned and free memory addresses from those twin sorted arrays as soon as they were in the final array, and then just return the final array.

Amazing video, really! I was not expecting this high quality, but here it is! You gained a new subscriber.

Loved the visual style

Just stumbled upon this and gotta say it's really well made! Keep it up :)

20:09 AMONG US on purple bar

host is teaching me more math then school ever did, and making it interesting

There are a couple of algorithms used on really old, serial access (i.e. tape) backing store. The first is the Fibonacci sort: Augment the list to make a fibonacci number (say F[n]) of items and split them between two tapes, the first (tape A) containing F[n-1] and the second (tape B) F[n-2] items. Each item on these tapes can be considered a sorted list of length one. Merge sort the first list on tapes A and B onto a third tape (tape C), and repeat for F[n-2] times. Now, rewind tapes B and C. Tape A has F[n-1] - F[n-2] = F[n-3] lists left. This becomes the new tape B. Tape B is finished, so can be used as the new tape C. Tape C has F[n-1] sorted lists, so can be the new Tape A. Repeat this until there is just one sorted list. The other one is an extension of this, called the cascade sort, where, instead of just three tapes, there are k tapes, and tapes 1 to k-1 are merged to tape k, then the tapes are cycled, so tape 1 becomes the new tape 2, tape 2 becomes the new tape 3, …, tape k - 1 becomes the new tape k and the tape k becomes the new tape 1.

amazing video you explain everything so well

This is amazing. Thank you

Awesome stuff!

Wow, this video is a really good work, congratulations!

30:00 its really cool to see algorithms that only work in the real world! im really glad you included these

in-place merge sort would've been a nice mention. Also the two ways of quicksort partitioning. And in terms of joke sorts, demon sort is one of the more interesting ones :) And then there would be threading optimization with odd-even sort and merge sort… ah, but I haven't seen the second video yet. Great work, anyway!

I wanted to see how Radix works, and this video explained it so well. I'm only really a beginner at coding, and I had an "OHHHH that makes sense" moment in this

the best video ive seen on this subject

20:09 *a m o g u s*

Amazing video!

Fluxsort and Quadsort would be pretty interesting to cover as well for the part 2!

ive been using bubble sort to maintain the sortedness of arrays, works pretty well if nothing huge needs to change

brilliant video and your voice is really nice too. will definitely rewatch next year when i have an intro to programming class :)

20:08 I love you for this

22:42 For best performance you would count the digits without copying the array to the second buffer, after counting you would do the sort copy to the other buffer, then count, sort copy back, and keep going until one of the two arrays has the final sorted result Computational complexity is the same, but it's more performant

Cant wait to see thanos sort. If the array isnt sorted, remove half the items at random. Repeat until the array is sorted

This video is really helpful. Keep going bro 🔥🔥

When it comes to Bucket sort I'm guessing you can preserve the efficiency of algorithm on non evenly distributed arrays if you know what distribution your data is expected to be, so that you can put more buckets on the densest parts of the array. Also, I wonder if you could do multiple steps of evenly distributed buckets, but only split buckets that are above a certain size. My guess is that it would boil down to another algorithm.

Fun fact: a quantum bogosort would in theory always resolve in 1 step (if done correctly)

I'm saving your videos for when it's 3 am and can't sleep

I think you don't need merge sort to use the additional array, you can do all in the first one with pointers

I feel like the statement radix can only sort integers should come with an asterisk. Shouldn't you be able to map any object to an integer and achieve the same results? This would require some preprocessing if it's not baked in to the object itself but could still be done quickly in some cases. For example if you're sorting cities by country->city you could generate an integer encoding for that data to then perform radix on.

Here's an interesting variation on the Bogo sort: it will only randomize groups of sorted sequences, then at next check, it will do it again with the new group. Will this be better or worse than regular Bogo? The intuitive answer would be yes, but how would you prove it? My approach would be that there are situation where the list is piecewise sorted and the randomization sorts it right, so it can be a reduction in time complexity, though inconsistent because it only works in one condition but it's also a significant increase in space complexity because you need to keep track of which are the sorted lists.

I was just about to cover this topic, but you did it first.

I've written a node.js package for sorting in the past and just went back to mess with it again a little and I found out that I wasn't benchmarking node's native sort method for Arrays correctly (it was sorting the input array in-place and then in subsequent runs already had the pre-sorted input). Now I wanna rewrite my package and try double selection sort while I'm at it.

Corection at 9:35: Shouldn't the pivot be a random value in the list that we swap to be the first value? That way, we make it less likely that some preoccuring pattern in the data will cause us to get the worst case runtime.

Nice. Subscribed ❤

That pancake sort might actually work on some kind of strange doubly-linked list if each link specifies which link of the following element to continue with

This is a very good explanation of these sorts! Are you planning to make the code for the visualisations public?

mine: you have list A and B, make list B numbers s-b (smallest number to biggest number in list A), then go through list B and remove any items in list B not in list A, because we made list B s-b, it was sorted, then remove all the ones not in A and we only have the ones in A

Yaay, SFML! I used it last semester for some assignments but haven’t ever seen it named in a project someone else has done, so I wondered if it was commonly used or not.

Hey! Loved this video :). Small observation I would make is when you're comparing algorithms, maybe use a gradient from green to red to order their complexity :)

No matter how many times I get it explained to me I can’t ever fully understand big O notation. Which is funny because back in the day I was an avid sorting algorithm enjoyer, having made over 90 sorts myself.

This explained sorts in plain language, much better than others have done. Nice flag, too (0:06). 2:35 - A Numberphile video showed that Selection and Insertion are the same sort but reversed. 20:00 - That's not the only way to do Shell Sort. If a pair is swapped at the current gap, compare to the left at the same gap size, repeat until you reach the start of the list. It guarantees that all items at the current gap size will be in order, moving items which might have been missed with a larger gap on previous iterations. Example with gap of three: 4,7,2,9,1,6,5,8,0,3 compare 4 & 9; compare 9 & 5, swap, compare 4 & 5; compare 9 & 3, swap, compare 5 & 3, swap, compare 4 & 3

From now on I'll exclusively use BOGO sort for everything.

one thing possibly missing from the obscure sorts list is examples program synthesis and machine learning producing novel algorithms which are not easily explained

Bogo has always been my favorite. Not many sorts can go from "1st try" to "heat death of the universe."

33:40 I had the subs on and it said: "*Bogosaur* is unique because it's not guaranteed to sort the list on finite time." 😂

In terms of complexity sleep sort is actually weirdly interesting to discuss. Just sleep as long as the number is, and it will print the items likely in order, assuming the minimum difference in sleep is greater than any expectable jitter in the threading handling. While the time complexity is O(n), the efford is actually barely anything. While certainly in the list of impractical sorting algorithms, it is actually implementable at least.

How is merge sort n space complexity? I can make a program that does it without using extra memory!

Great video!

20:08 among...

Me when seeing gravity sort somehow have everything go into place (particularly on a circular visualization): oh so that makes everything fall to its correct place “Gravity sort *insert stuff blah blah blah it uses gravity ok*” Me: oh it literally does that

Very cool thank you so very much

Sleep Sort, where you make a thread for each item, let them sleep for that, then they will wake up in order

A little while back I saw a video on BOGO BOGOsort (if I recall the name correctly). Iirc it's some kind of bogosort nested in another bogosort, but I forgot the details

my fav sorting is cosmic ray sorting, which basically waits for the cosmic rays to flip the bits and somehow the array will be sorted lol

I'm not complaining about the content, because that is ACE, but i'd low cut the vocal track with a EQ or HPF at minimum 85hz. maybe you can even cut it at 120-130hz based on tonal features of your voice, do it post process, not pre. Just a little free tip that will make the sound more consistent through the series. (that is, if you use the same microphone, and the same room ofc) There is a very audible deep humming which i suspect you can just filter away.

Radex sort is where it went over my head I think. Could be that 20 minutes of thinking is my limit for one sitting though.

Is a sorting algorhythm possible where the average time is so bad it's a function like Grahams function, TREE or SCG?

in the discussion of radix and related sorts, I fail to see how, in practical implementation, the range can be anything other than O(1), since any practical number representation has a fixed bit count (short of arbitrary precision data types, but who actually uses those). A radix256 sort of a 32bit number can be done in 4 passes, no variance. It doesn't matter if the 32 bit values are int or float, since floats can be turned into a value-ordered sequence of integers by a simple bitwise operation during the first pass, that is easily undone during the last pass (forward: flip all bits of negative numbers and just sign bit of positives). Otherwise a very clear, concise and well presented review of sorting. Thank you. Moving on to ep.2 now...

Nuclear Bomb Sort: sets EVERY element in the array to 0 and checks if it's sorted

in languages with pointers, you can make a list where each element has a pointer to the next element. using this structure, you can shift the entire array by using the pointers and not repeated reading and writing.

Well that escalated quickly

"Words are just 26 bit numbers" God i've never thought about it like that.

13:43 actually, selection sort can be stable, depending on how you find the smallest/largest number, and how you implement the algorithm

I don't know if I'm stealing an idea but couldn't you work from left to right, if a piece is smaller then the one on the left of it, put it at the start. I don't know if I'm wording one you talked about differently, if you mentioned it and I forgot or if I made it up and it's no good

Have you heard about our Lord and savior, Faith Sort? This simple algorithm is sometimes considered a joke, because it starts from the assumption that the list is perfectly sorted when we receive it, and never actively changes the order of the sort while always insisting that the list is properly sorted. If the order of the list happens to change between Faith Sorts, it is still sorted as it always was and always will be. Amen.

I like the vid! something you may want to clarify about binary search insert is that in theory it's faster in practice it's not. The check is O(nlog(n)) but the act of inserting it in the location and shifting makes it O(n^2) still. So it's actually not better.

My favourite sorting algorithm is the O(0) (or would it be O(1)?) Ba Sing Sort, aka "there is no out of place value in the array". You don't do anything, and the array is already sorted. Trust me.

i have NO clue what most of this means but im having a BLAST. anyways ENBIES REPRESENT!!!!! LFGGGGG

I think there is a problem with the way you described quicksort. If the pivot happens to be the largest element in the list, A will scroll all the way to the end of the list and meet B without making any swaps. Then if you place the pivot to the left of them, the element to the right of the pivot (where A and B meet) is going to remain smaller than the pivot, but also be on the wrong side of the pivot, with no chance of making ever getting sorted.

what about merge sort with odd number of items?

20:09 I see you

If I’m not getting quantum computers wrong, will bogosort unironically be the best sorting algorithm in the future? A qc could just do a ton of bogosorts at once and after a few seconds at max, one of the calculations worked.

Thanks!

This is completely unrelated to anything, but you might be interested to know that your first name "Kuvina" means "as/with pictures" in Finnish. Fitting for a visual medium like YT :)

at around 22:37 the grid that comes up looks like a fractal

new idea, scan the list, consider that the way its supposed to be sorted, boom

masterful presentation, lots nuance is packed into every part

I accidentally subscribed. *+1 sub*

Can’t you do both merge and quick sort without creating new arrays? In which case they would both have constant space complexity as well.