90 Sorts on Large Inputs - Scatter Plot

[@sadeqqsm8157]

I feel like a cat staring to a laser point

[@HexDeck]

5:15 YES CONSUME THE RECTANGLES MY SWEET LITTLE RED SQUARE

[@XDBot_GOATED]

what

[@americanskylines2789]

Favorites so far: 3:18 death metal font 5:14 microwave 13:30 unexpected 13:42 tv static 19:19 railroad tracks 20:20 railroad tracks vs tv static 21:20 fireworks 23:25 I don’t know 25:08 anxiety 25:45 string instrument 26:40 10 trillion sounds 27:55 pencil sharpener 31:58 MY FAVORITE OF ALL TIME 34:08 actual art 36:12 W 45:15 beeooo

[@rickgreer7203]

You might like the band MASTER BOOT RECORD. Essentially this, but with more...

[@thegamesquad5133]

36:12 wuwuwuwuwuwuwuwuwuwuwuwuwuwuwuwuwuwuwu

[@TheBoringFamily]

am i seeing 26:40 as a spinning cube

[@thefrenchtechman]

@@TheBoringFamily holy shit I see it too

21:20 fireworks is like how parents prevent any escape to comfort

[@Meaningless94527]

Exchange Sorts (17): 0:03 1. Unoptimized Bubble Sort 0:25 2. Optimized Bubble Sort 0:39 3. Unoptimized Cocktail Shaker Sort 0:55 4. Optimized Cocktail Shaker Sort 1:06 5. Odd-Even Sort 1:20 6. Gnome Sort 1:32 7. Optimized Gnome Sort 1:41 8. Optimized Gnome Sort + Binary Search 2:07 9. EarthBound Sort 2:44 10. Comb Sort 3:18 11. Recursive Circle Sort 4:16 12. Iterative Circle Sort 5:14 13. Quick Sort (Left/Left Pointers) 5:56 14. Quick Sort (Left/Right Pointers) 6:20 15. Dual-Pivot Sort 6:43 16. Stable Quick Sort 7:11 17. The Studio's Optimized Stooge Sort Selection Sorts (12): 7:54 18. Selection Sort 8:27 19. Double Selection Sort 8:50 20. Cycle Sort 9:51 21. Max Heap Sort 10:26 22. Min Heap Sort 10:52 23. Flipped Min Heap Sort 11:17 24. Weak Heap Sort 11:46 25. Ternary Heap Sort 12:13 26. Smooth Sort 12:45 27. Poplar Heap Sort 13:10 28. Tournament Sort 13:43 29. Pancake Sort Insertion Sorts (6): 14:34 30. Insertion Sort 14:47 31. Binary Insertion Sort 15:16 32. Shell Sort 15:45 33. Patience Sort 16:16 34. Unbalanced Tree Sort 16:49 35. Library Sort Merge Sorts (7): 17:41 36. Merge Sort 18:46 37. Bottom-up Merge Sort 19:51 38. In-Place Merge Sort 20:19 39. Andrey Astrelin's In-Place Sort 21:17 40. Selection Merge Sort 22:11 41. Lazy Stable Sort 22:54 42. Rotate Merge Sort Distribution Sorts: (14) 23:49 43. Counting Sort 24:01 44. Pigeonhole Sort 24:11 45. Gravity Sort 24:58 46. American Flag Sort, 32 Buckets 25:27 47. Least Significant Digit Radix Sort, Base 4 26:06 48. Most Significant Digit Radix Sort, Base 4 26:38 49. In-Place LSD Radix Sort, Base 10 27:28 50. In-Place MSD Radix Sort, Base 10 28:32 51. Flash Sort 28:53 52. Recursive Binary Quick Sort 29:22 53. Iterative Binary Quick Sort 29:50 54. Shatter Sort 30:07 55. Simple Shatter Sort 30:44 56. Time Sort, Mul 4

[@kp2k]

0:02 unopt bubble sort 0:24 opt bubble sort 0:39 unoptimized cocktail shaker 0:54 optimized cocktail shaker 1:06 oddeven sort more soon and here are my favorites 26:38 inplace lsd radix sort base 10 59:44 less bogo sort

[@robertspeedwagon982]

Always amazing to look at a visual representation of the effectivness of the quicksort algorithms. It's crazy how fast they can operate.

[@FriendlyFloyd7]

Hang on, "EarthBound sort"? That's a new one, why's it called that?

[@mjb20077]

Taking A Guess From Another Video On This Channel That Has EarthBound Sort; It Takes The Left-Most Unsorted Value And Tries To Find Any Values Lower Then It. If It Succeeds, It Gets Swapped. Repeat.

[@mjb20077]

It's Actually Called 'Exchange Sort', And This Channel Calls It EarthBound Sort In Reference To The Fact The Sort Is Used In The SNES Game EarthBound. Edit: See @tcxd1164 's Comment Below Mine

[@tcxd1164]

​​​​​​​@@mjb20077 Some interesting details: - Any sort that swaps positions would be called an exchange sort, but: - The video author claims it's just called Exchange Sort by the researcher who wrote the paper about this algorithm, and: - Reading the PDF from the link they gave in another video, it's not even called that at all; in fact, the researcher didn't even really name it at all, aside from giving the pseudocode used to describe it the label " *Algorithm 1* ICan'tBelieveItCanSort(A[1...n])", which I doubt most people would consider a name. I think the video author is mixing this label up with the other example algorithm within the paper, which just shows a standard bubble sort labelled as " *Algorithm 2* ExchangeSort(A[1...n])". - The actual algorithm is like this: 1. from i = 1 to n, do: 2. from j = 1 to n, do: 3. if A[i] is smaller than A[j], do: 4. A[i] swap with A[j] (This is basically what you've described in your comment. The only notable part is that the loops are not constrained in any way; each loop will be a full loop from start to end.) - This algorithm counterintuitively sorts in ASCENDING order. The proof is a bit hard to explain in a KZbin comment, though you can just write it down by hand to see why it works. - It's slower than bubble sort and doesn't even improve beyond insertion sort time when optimised. I think you can see why it's not really given any sort of detailed research.

[@someaccount5200]

@@mjb20077 that's exchange sort

[@Musicombo]

Used in EarthBound! kzbin.info/www/bejne/oZvNg3mqaJifi7c

[@frogfan449]

For the algorithms that only write to an auxillary array most of the time, I wish the other array(s) were shown where that would be reasonable.

[@Musicombo]

Planning that soon!

[@BunkerSquirrel]

It’s really interesting to see how some of these sorts trade comparisons (cpu time) for memory writes and vice versa

[@simonachtnich4417]

I love these videos! Would it be possible to show the auxiliary array for the sorts that use it, as it is not very interesting to see a sort where nothing happens for a while and suddenly the list is sorted. And would it be possible to include the pseudo code, because some of the more exotic sorting algorithms are difficult to find. Thank you for providing us with countless hours of entertainment.

[@Musicombo]

I'm planning an auxiliary array video!

[@michael.de.radobyl]

My favorite: 29:38 In-Place LSD Radix Sort

[@Bubu567]

26:38

[@Swaaaat1]

I was looking for this exactly. Thank you

[@Jus10Ed]

0:40. A rift in space closes.

[@tamanoti]

This video is the first time I have seen a scene where Bogosort has properly completed a sort. Impressive...

[@anonymous-q2b5s]

Never heard of 20:20 but looks very impressive! So fast without extra memory!

[@elparpo9]

prepping a shot of coke

[@myushankaiswarm]

This scratched the itch in my head that I couldn't reach.

[@Lolek14-vk8rf]

Yo dud congrats 👍

[@cycloneshocke7208]

yay funny sorting algorithm video holy moly EDIT: 26:40 is literally the bees

[@AlbySilly]

The most visually interesting one

[@Aurum_Enterprises]

Mettaton

[@toothpickprovider2614]

that's lsd radix sort for you

[@DaughterOfDrakes]

The most practically impractical sort method: Redefinition sort: Step 1: Determine the contents of the list to be sorted Step 2: Define an ordered list as one in which the contents are identical to those in the list to be sorted Step 3: Per your new definition of ordered, the list is now ordered.

[@ishu4227]

I would call it "Definition sort" becyse it defines a new dfinition of ordered

[@quocphong6588]

29:51 has the new fastest sort beyond quick sort or LSD radix.

[@KingGamereon]

@@quocphong6588 I may not be understanding the terms, but didn't pigeon hole sort get 3.4ms?

[@quocphong6588]

@Aron-i3l Ohhhhh. I see, it’s just the 2nd fastest sort

[@KingGamereon]

Still an honourable spot to have among sorting algorithms

[@Andrew_animator]

Actually shocked bogo sort actually sorted something in a video First time i've seen someone let it go until it sorts

[@zlodevil426]

Heavy metal band: our logo is easy to read their logo: 3:25

[@andreshandle]

I think it would be really cool to see a video where all the sorts are given the same amount of inputs to sort, but there is no delay added, so we can see just how fast each sort is at sorting that amount of inputs

[@TF2Starlight]

@@andreshandle some will last forever

[@sky173]

This is awesome. 2:55 - would be a great alarm clock in the morning, lol

[@C-SPA]

random friend: hey what are you watching? bro: SORT

[@Holac0moestan132]

The slight reverb makes this so magical

[@CodeWeaverCW]

Damn, comb sort looks really good if you only need a loose ordering and not an exact one, really fast

[@JoeTaber]

It'd be cool if there were a google sheet with all the sorts and their stats.

[@TigerYoshiki]

I've seen many sorting videos but this one keeps you occupied for one hour.

[@niaschim]

1:12 Timestamp. When each side of the odd-even sort have met in the middle, but they haven't fully straightned themselves out yet, and the baseline curve resembles this odd sigmoid function. That's what I imagine love looks like♡♡♡♡

[@synexiasaturnds727yearsago7]

Thumbnail looks like something some spacetime ripping qt would make

[@mv-jp8ul]

Earthbound sort is goated, all of the sound effects also sound like SNES effects too

[@sixeleven637]

25:08 ENHANCE!!

[@SREagle1]

26:39 - ... LSD ... - indeed, quite trippy 🤪

[@bat__bat]

I'm less concerned with the algorithms on screen as I am with the algorithms that got me here.

[@bonelessChillies]

The sounds for the In Place MSD RADIX SORT BASE 10 make my ears itchy in a good way

[@samasadollahi6649]

2:08 someone tried psi on this

[@septicstache9625]

Four years ago I graduated and studied sorting algorithms for my computer final, and weirdly enough, I can still take a short look at each sorting type and tell what steps each type takes to sort the numbers 😂 how do I still know this??

[@loishik5404]

Could you make a video covering the new driftsort and ipnsort algorithms? They were just merged to Rust's standard library, and it'd be great to see them in action.

[@Musicombo]

Never heard of them! I'll have to look into them and then refactor them in Java.

[@m_affiliates]

I'm tempted to ask for every sorting algorithm (including extended sorts) doing every shuffle in a single video but I can't even begin to imagine just how long that video would be

[@ishu4227]

over 200 sorts over like 50 shuffles, 10000 sort sessions, oh god

[@m_affiliates]

@@ishu4227 the ultimate video

[@Tech1ty]

And once again I find myself of sorting algorithm youtube

[@Omegation2024]

can you do a In-Place Radix LSD Sort, Base 4?

[@Musicombo]

Why Base-4 specifically?

[@brainboy53]

It’s popular I guess.

[@Musicombo]

@@brainboy53 But... in-place Radix LSD is already included in this video...?

[@brainboy53]

Wait you’re right.

[@dukem8774]

Count and flash sort did really well, I'm assuming they have issues with non-linear data sets if they aren't universally used?

[@U_FloVV_U]

Is there any overview of the results? And maybe even rating in sense of time, cpu time etc.?

[@blackflask8254]

Hey there! I love all these sorting videos that you have, it inspired me to optimize Gnome sort especially since I kept seeing it in your videos that an optimized variant of Gnome sort exists, but I can't see it anywhere so I made my own. I made the optimized variant in Rust and criterion tells me that the optimized version has 22% performance improvement over the original, the difference is especially huge on reverse sorted input, are you interested in seeing my Optimized Gnome Sort in Java or any language you prefer? The changes are quite simple and you can definitely catch up to it quickly, maybe even add it to your sorting algorithm visualization application. Thank you for your time!

[@ishu4227]

21:16 Merge sort: "Oh great, now we're taking random sorts and making them recursive and calling them 'merge sorts'? That's disrespectful." Lazy Stable Sort: "Then how come you never say I'm disrespectful?" Merge sort: "...Shut up." EDIT: this was before i knew Lazy Stable Sort used rotations instead of being bubble sort. Sorry about that

[@theendofthestart8179]

22:22 sounds like galaga

[@cropulturaarts]

I have been watching algorithm sorting videos for the past 2 days despite not knowing anything about sorting whatsoever

[@cosmnik472]

20:19 is fire

[@FloydMaxwell]

(1) why aren't these normalized (i.e. same dataset size), and (2) why aren't these presented from slowest to fastest ?

[@dellosCao]

Should have a list for fast references

[@the_birch_tree]

arrayV is not compatible with 1366x768 screen

[@Musicombo]

It should be; what's happening on your side?

[@the_birch_tree]

@@Musicombo the change sort and other stuffs that open a new window thing ALWAYS get outside of the screen, and you can't drag it either

[@Musicombo]

@the_man_of_birch Oh dear! Please be sure to submit an Issue on the GitHub repo ❤️

[@the_birch_tree]

Can't log into github because the verification email is always 2+ minutes late

[@goose_clues]

@@the_birch_tree 草 新しいアカウント作れよ

[@HitSpaceGD]

8:27 sad analog noises

[@PIGEON5265]

I don't know what the hell i am watching but i love it 😀

[@Projection_]

I guess my question is which sort is most efficient (in terms of time spent per amount of numbers given)?

[@jacknguyen5220]

That's what the numbers on the side are for. Different algorithms will be more efficient in different aspects. Being better in specific aspects is a tradeoff in other aspects. And for the ones that suspiciously show 0's, like the radix sorts, they're sorting the numbers in a way that isn't comparable to other sorts.

[@flavex99]

The best comparative algorithms in terms of time and space complexity is Merge Sort, Heap sort, and Quick Sort each of them could have little optimizations for specific cases.

[@cariyaputta]

Is there any sort video with the same input and same delay?

[@SomeoneCommenting]

So, which one won? They don't sort the same number of samples, maybe it should have been arranged by worst ones first with a few samples, then average variations, then the fastest or most efficient ones at the end with the over 32k samples to sort.

[@PW_Thorn]

There's a constant thing with all of these : shuffling always go faster 😂

[@FalconHgv]

Some of these sound like one of the sfx from MGS3 whenever you eat (or cure something? Don't remember really)

[@nemonomen3340]

These algorithms are brought to you by the algorithm. Thank you.

[@robbywiltsey5660]

Does every algorithm have a unique advantage?

[@Fjeldhammer]

Can someone please explain how to get this program (edit: nvm i figured it out)

[@truongquangduylop33yyuh34]

Request: Over 70 sorting algorithms in under an hour - Shifted Element

[@bergencounty_elevators]

Wow. You're back. Unreal. Just curious, I was using ArrayV 5,1 the other day, and am curious, When are we gonna be able to see auxiliary arrays in the videos?

[@Musicombo]

Soon!

[@redfruit1993z]

So, that's what an algorithm sounds like.

[@ishu4227]

Suggestion: Sorts on "Fly straight, dang it!"

[@Spax_]

can't believe I just sat through that

[@Littlebrownchicken]

Earthbound looks awesome

Would be neat if these were SORTED in ascending order of superiority, i.e. most to least sort time, comparisons, swaps, etc.

[@geosmindonothack9699]

Bad news for me. There is an annoying error about missing drum channel from arrayv. Can you help me. Because I use the in-place LSD radix 16 base but there is a problem for me.

[@ishu4227]

splay sort: *sitting in the rain*

[@daniellaizekemoe1967]

the 49th and 61st were my fav

[@griffinmartin6356]

how do you do the visualization? is every piece needed to be sorted a vector? so then you can put it on a 2d plane? or do you separate the numbers into two different numbers (for example in a 64 bit number you take the first 32 bits and the last 32 bits)

[@Beatsbasteln]

can you upload just the sound, but without the reverb pls?

[@bongofin]

i want an idle game like this

[@NitroFunWon]

50:24 - 51:00 is sick, sounds like a hyper laser gun

[@UZURPATOR_]

Which one won in terms of speed?

[@Scudmaster11]

Shouldn't there be reversed max heap sort if there is reversed min heap sort? Does that also mean that introsort can have its max heap sort replaced with reverse min heap sort? (Kinda curious now on how it would visualize LOL)

[@Musicombo]

Reversed max heapsort would produce a reversed output.

[@ishu4227]

Yeah. The only reason Reversed min heap sort exists is because Min heap sort creates a reversed output.

[@Scudmaster11]

@Musicombo by the way.. I did find reflection sort and implement it in visual programming to see if it was it (and it was)... I might send the link or code (from arrayV gethub) here for it (if you want)

[@Scudmaster11]

@@ishu4227 I know.. it was just a thought to make the reversed output then flip it at the end

[@Musicombo]

@@Scudmaster11 Send it here!

[@TWGuardian]

Hi! Odd question but is the Holy Grail sort still being worked on? I've been looking to implement it but the github repo states that it is broken.

[@Xavier-op3us]

35:39 I see a W of Ws of Ws in like, 5 seconds And it keeps saying wow lol

[@ishu4227]

I have two questions: 1: how do you get the sound that you use? When i ran ArrayV (mvnw ver, not jar) i didn't get the same default sound as you, but the JARdid. Can you explain? And no 2: How do you record it fullscreen? When i try to use obs studio to record arrayV fullscreen, it doesn't work. Ialso can't make arrayV fullscreen.

[@ishu4227]

Also, if you are using your own program, (the one from your own github, not Gaming32's), why link to Gaming32's? I know this isn't Gaming32's because of the style of the highlights on the dots: Here, they are boxed but in Gaming32's they are enlarged and highlighted. Also the dots in Gaming32's version are smaller than the ones here.

[@Cypekeh]

I love this plot

[@jollygooberino]

12:55 - 14:07 most replayed part

[@PointyTailofSatan]

I found this sort of interesting.

[@morthim]

grail sort should have been called space invaders sort. i hope doom sort is included.

[@alejandroandmariasoto2102]

And even moving

[@riril4977]

Спасибо меня перепрограммировали этим видео теперь я раскрыл все возможности

[@bomblii]

i love sorting!!!!

[@alejandroandmariasoto2102]

I see like the white thing like teleporting

[@FajarAndiPatappari]

This is what youtube for ❤

[@Seega_kit119]

36:12 \/\/

[@subsonicwave64]

MSD base 10 makes me fear your capable of programming a quicksort with 10 pivots O_o

[@ekxo1126]

51:00 pong

[@chair547]

The ones where it just does mystery writes to an aux array and then magically sorts out the original are kinda boring

[@corncake4677]

You’re kinda boring

[@ЕвгенийШестов-р7н]

36:26 Z sort

[@waffentrager_auf_e100]

наш слон💪

[@Orin_incoming_907]

Hold on, "unoptimized bubble sort" and "unoptimized cocktail shake sort"? That's stupid. How is it called like this!?!?!?

[@zaphhood4745]

Do miracle sort.

[@Uofs9rso777]

Hi

[@jayamarillo628]

Yay!

[@BroodWar4Ever]

What I came for 18:33

[@theresa.y5221]

FIRST

[@korriannavanheart8911]

Alright, we get it, you have a giant ego.

[@hermask815]

You’re some sort of guy!