50+ Sorts, Visualized - Swirl Dots

[@Musicombo]

Join our community Discord! discord.com/invite/2xGkKC2

[@D144AU]

Cool! Did you just pin this?

[@Musicombo]

@@D144AU Yup, just pinned this!

[@avery-u1w]

ok

[@ExcaliBurnGD]

Huh what?

[@jaydenrandoms2409]

Bro I just posted a volume warning for radix sort base 16

[@ajbatterman3720]

I feel honored to be among the privileged few who got this in their recommended.

[@bamdenie3466]

Same but I have no clue what it is still

[@JaceSomers]

@@bamdenie3466, the video is showcasing sorting algorithms with points on a spiral.

[@dislike__button]

$5

[@JCrashB]

Me too, sorta.

[@maskmarvin803]

Yeah, even I gt here.

[@digdug1489]

Other people: let's watch something I understand Me: haha sorting algorithm go brrrrr

[@Xevizek]

quality comment.

[@dorukcelebi1655]

best comment i've seen in a looong time

[@rigzmoviediaries654]

wow you're so special

[@digdug1489]

@@rigzmoviediaries654 see my balls

[@skjorta1984]

quirky 🤪😜 lol

[@coolcorvoid]

I'm a huge fan of the "estimated real time" counter, so I can see which sorts are actually faster! It's hard to tell a lot of the time, with different sorts being slowed down different amounts.

[@Musicombo]

Thank you!!

[@WurstRELOADED]

Exchange family 0:04 Bubble Sort 0:22 Cocktail Shaker Sort 0:37 Gnome Sort 1:05 Optimized Gnome Sort 1:22 Odd-Even Sort 1:41 Comb Sort 2:09 Quick Sort 2:22 Stable Quick Sort 2:43 Dual-Pivot Quick Sort Selection family 3:05 Selection Sort 3:16 Double Selection Sort 3:28 Max Heap Sort 3:52 Min Heap Sort 4:17 Ternary Heap Sort 4:37 Weak Heap Sort 4:53 Smooth Sort 6:07 Tournament Sort Insertion family 6:37 Insertion Sort 6:54 Binary Insertion Sort 7:12 Shell Sort 5:15 Cycle Sort 7:28 Patience Sort Merge family 7:41 Merge Sort 8:30 In-Place Merge Sort Non-comparison family 9:00 American Flag Sort, 256 Buckets 9:14 Bead (Gravity) Sort 9:40 Counting Sort 9:46 Pidgeonhole Sort 9:52 Radix LSD Sort, Base 4 10:22 In-Place Radix LSD Sort, Base 16 10:46 Radix MSD Sort, Base 8 11:08 Flash Sort 11:20 Shatter Sort 11:39 Simple Shatter Sort 12:00 Time Sort (Mul 4) [more widely known as Sleep Sort] Sorting Networks / Concurrent family 12:16 Batcher's Bitonic Sort 13:11 Batcher's Odd-Even Merge Sort Hybrids 13:34 Hybrid Comb Sort (Comb/Insertion) 13:55 Binary Merge Sort (Merge/Binary Insertion) 14:41 Weave Mergee Sort (Merge/Insertion) 15:34 TimSort 16:18 WikiSort (Block Merge Sort) 16:57 GrailSort (Block Merge Sort) 17:24 std::sort (Introsort) 17:46 Quick Shell Sort (Introsort with Shellsort) 18:06 std::stable_sort (Insert/Bottom-up Merge) Esoteric / Fun 18:35 Pancake Sort 21:14 Stooge Sort 22:09 Bad Sort 22:30 Silly Sort 24:10 Slow Sort 25:51 Less Bogo Sort 27:10 Cocktail Bogo Sort 28:37 Bogo Sort

[@runthere100]

thx

[@raynel1000]

What is this video? I have no idea what im watching

[@grovemeister04]

@@raynel1000 These are different sorting algorithims usually used by computers. Here's a TED-ED Video if you'd like to learn more. kzbin.info/www/bejne/jZKxfX2cbd2teZY

[@runthere100]

@@raynel1000 different logic style shit for computers to Read/Write/sort ect.

[@jaykoerner]

@@raynel1000 a visual representation of algorithms to sort objects, mainly used for numbers but I guess it works for anything

[@sebastianwiesendahl5348]

9:39 counting sort is unreal

[@TheSuckerOfTheWorld]

Pigeonhole sort was even better

[@gabriellasso8808]

O(n) sorts are unreal But they aways have soe restrictions... Conting sort woks only when the numbers are in a known interval, and the larger the interval is slower is the algorithm

[@s_feles_2642]

With a reasonable interval (let's say 1-1000000) it can be done in O(n) time. However as an integer's max absolute value is 2^32, those can't be counted in an array - one would use an associative container, like a map, instead. Since inserting an element into a map takes O(log n) time and one must insert n elements, the total complexity would be O(n log n), which is similar to (for example) quicksort or mergesort.

[@ToyKnives]

Counting sort is good for numbers, but if you’re sorting complex objects, it’s pretty useless.

[@homemadefilms5718]

That makes sense, counting numbers is pretty quick and easy

[@cccooooooolllllllll7344]

16:44 The demonetization sort

[@Musicombo]

Oof.

[@Stev4iK_FeeD]

28:36 I'm so proud of Bogo :)

[@sugar2000galaxy]

It finally finished sorting something!

[@mono_si]

bogo hours

[@forktographer861]

@@mono_si how hours

[@rubixtheslime]

Was it seriously first try?

[@samtoosmooth906]

Bogos binted

[@N1ghtSt4RxHD]

12:58 The algorithm is forming a heart

[@AlexKuz]

Or a breast

[@vynbit]

3 types of people

[@sean_underneath]

4 types

[@spitgorge2021]

this reply chain reads like a fucking tumblr post

[@villagernumber7882]

Or a squished orange.

[@MrRaja]

9:50 for radix sorts

[@indeepjable]

Thanks!

[@Sploo256]

got an ad

[@kaangamgimginnkagnagnkingmngkn]

There is no Radix Base 10...

[@BenJaded]

Yo what that's cool

[@Ramog1000]

I doubt there is an easy explenation on how it works, is there?

[@jmalmsten]

There are efficient sorts, there are impractical sorts, there are even beautiful sorts... Then there's that one sort that just decides to just go creative. 12:15

[@ianmoses3140]

❤️

[@bammam5988]

Parallel sorts are neat. They're often pretty inefficient on normal processors, but become extremely efficient when running on a GPU, where you can dispatch like 10000 simultaneous threads.

[@syrathdouglas1244]

I was sitting here thinking “why is it making leaves?”

[@c0zmozys]

and then theres 10:23

[@Kristof-w3z]

@@c0zmozys most menacing sort

[@dhaq5617]

11:10 When you know the answer to a problem but you don't feel like showing your work

[@dukem8774]

1.8ms

[@coyoteden8111]

LMFAO

[@shadam_free]

10:21 - My nervous system when I hit my elbow

[@cliftut]

Perfect. Somehow that just works. Have a good day.

[@spitgorge2021]

these are always so accurate

[@otesunki]

Ooof.

[@villagernumber7882]

*Ae* U *Ꮐ* h

[@skylinefever]

The odd-even sort and heap sorts look much more interesting in this mode than in other modes. Radix sorts are also more interesting because they convert several spirals into one spiral.

[@sodiboo]

and comb

[@dorukayhanwastaken]

Now if only odd-even wasn't _so. fucking. slow._ Is it meant for hardware like gravity sort?

[@theairaccumulator7144]

@@dorukayhanwastaken Odd-Even Sort is meant for parallel processing, where each element is processed independently on a CPU core.

[@johngamble5270]

@@dorukayhanwastaken Check out the sorting network page on Wikipedia. You'll see that the graphs of the comparators show which groups of comparators can be done in parallel. Odd-Even can be done as a sorting network.

[@Nintendo3DSdude1]

3:18 sounds and looks like a slow motion Pac-Man death.

[@alexanderjohnston5216]

At the beginning of the sound it also looks like Pac-Man

[@disgustingoozeling2476]

It does indeed!

[@goodluck6948]

yo that's true! how'd you notice that!!

[@quinn7894]

More like 4:54

[@psiangel]

It looks like a pac man death too

[@antimitsu]

10:24 That sound when I microwave my baked potato with the tin foil still on

[@guymandudething2657]

Silly sort: takes 18 actual seconds Me: yea seems pretty silly

[@Retsom3D]

18 seconds with 256 dots, with 2048 dots it would still be running.

[@417Owsy]

silly sort be like: lol nyeh nyeh nyeh I'm silly woooo yoohoo blbllbbllblblblb hahaha im a silly guy look at me

[@eclipse-music]

Slow sort: takes even longer

[@gamer_kid_naz4942]

This quarantine is making me watch some strange stuff

[@Artesisful]

We probably reach the end of the youtube algorithme proposition

[@amethystt727]

Same

[@dewaeryadi7776]

I watch youtube like 12 hours per day because of the quarantine

[@idontknowyoureally525]

😂😂😂

[@simoneserafini7917]

Yeah bro, I m italian it s my 19th day of quarantine, qurantine in my city started 7th march. You will live some really strange stuff

[@teknolozik]

10:10 Radix sort is just BEAUTIFUL.

[@maurolionelmipianoyyo11]

Radix LSD bases/sorts family 9:54 Radix LSD Sort, Base 4 10:23 in-place Radix LSD Sort, Base 16 10:47 Radix LSD Sort, Base 8

[@coyoteden8111]

in-place is mind boggling

[@toyama3307]

Radix sorts are always my favourite when visualized

[@panthererousse]

10:47 Radix *MSD* Sort

[@Northtamilland]

​@@toyama3307 samree

[@syfon16]

16:17 is my favorite, because it moves like an indecisive clock and also draw a curvy swastika in the process for some reason

[@p0tatogod533]

Sylvester Markotzki least favorite*

[@Rafael-oq9vu]

@@p0tatogod533 nooooooooooooo you cant say swastika nooooooooooo

[@thanhvinhnguyento7069]

Found the nazi

[@safe-keeper1042]

Hey, Nazis gotta sort things, too!

[@GewelReal]

@@p0tatogod533 most favorite*

[@jamesmccomb9525]

My days of watching sorting algorithms has paid off to show me even more sorts

[@ZM-dm3jg]

Are ya winning son

[@k680B]

why am i watching sorting algorithms again?

[@Halford_Steel]

Same

[@kaaroClips]

Because Google said so.

[@tmptmp6836]

Because the KZbin Algorithm says so.

[@mewtheenigma2732]

The real question is, why not?

[@HerbaMachina]

Cause this one is cool and different because it visualizes it with Fibonacci spirals instead of just the regular bar graph style ones

[@PeterDabkowski]

Just in case somebody wonders - angular position of a dot is a position in the array, the distance from the center is the magnitude of the number. When sorted, the magnitude is proportional to the angular position, hence spiral is formed. We start with a random array of numbers from 1 to 2048 (hence random pattern forming a circle).

[@TheSmegPod]

16:44 boutta get demonetized

[@tylerduncan5908]

Thought the same

[@Zakeksi4ek]

Thought the same

[@41-Haiku]

Thought the same

[@nameisChannelID]

Thought the same

[@BettyNoireMaSTeRProCraStInaToR]

Thought the same

[@toadfrommariokart64]

this has to be the coolest way possible to visualize the radix sorts (9:52) and Batchers bitonic sort (12:16)

[@parthadebnath3379]

12:20 is the best, from flowers to ass. It drew everything.

[@CharredRisotto]

28:24 My arm after it falls asleep

[@ISeeChase2]

The min heap sort ending at 4:08 is unbelievably satisfying.

[@Yatsuzume]

3:16 RIP pacman

[@小彭-t5n]

Can you graze them though?

[@PhantomizeMC]

genius

[@raphaelkelly861]

incredible

[@Myles462]

7:27 what happend ? o.o it's like, it was just looking around and suddenly figured out the right order lmao

[@Myles462]

9:37 is even better lmao

[@zdddddd]

-you are already dead. -nani?

[@gralha_]

it was ordering them elsewhere, and when it was ready just copied it to the visualized array

[@yky1360]

Zahid 😂 this is sooo epic man

[@sleebu]

Myles 9:45 is better

[@sodiboo]

comb sort is so much more pleasant to watch in this format

[@amethystt727]

Did I just watch a computer sort dots for 30 minutes? Yes I did.

[@jari948]

12:17 is beautifull and i have no clue what that computer is doing

[@justinalecorellana]

I wish someone would make a sort video that would give a short explanation of how each sort worked.

[@Musicombo]

Might do that in the future!

[@dizzydaisy909]

@@Musicombo Did you? It's been a while

[@alexmijo]

I want one ranking sort speeds on initial arrays that are random, reverse sorted, almost sorted, etc., to show the strengths and weaknesses of various sorts. All these vids seem to just do random initial arrays.

[@edward17829991]

Is this ART? : SORT of...

[@reversal]

I like the moment it drew a 6

[@Mycatkeepstryingtodestroymybed]

not a 6 I think

[@Scuud52]

10:00 ok this is beautiful!

[@saysoonkim9561]

Lsd sort

[@dave5194]

10:24 The language of the gods

[@musicbot1332]

Sounds like it came from nier Automata

[@nicklausgutknecht6226]

PS2 start up

[@Handler76]

well it has LSD in its name

[@gnostaoticanarchangautand]

That's my jam.

[@oberonpanopticon]

This is definitely the coolest visual representation of sorting algorithms I’ve seen so far! You can really see the differences between the different algorithms, and a lot of them are pretty mesmerizing too!

[@LiamsMusic78]

9:52 this and next one, crazy visuals! love it! 11:08 extremely fast 9:00 muricuh

[@Gran69]

1:42 - Salvador Dali combing his moustache

[@ChildOfTheLie96]

16:43 *Banned in Germany*

[@mrkitloin]

My teachers: he’s so smart he will go places in life Me on top of my roof: 0:04

[@zanthrasw]

8:30 For In-Place merge sort, if the first element of the second sub array is lower than the first element of the first sub array, you move everything between where you are inserting that element and that element's index up one array index to make room for it in place. This requires no additional comparisons. The comparison count for In-Place merge sort should be no higher than normal merge sort.

[@thechatter7102]

my boi Radix LSD Sort out here absolutely PERFORMING as always

[@maxpuigpowell8630]

Fun fact: you can only be recommended this video, you’ll never see it otherwise

[@user_rKChwLeBqKYyurEfiSLFmCBNC]

how girls sort things out 9:39 how boys sort things out 10:22 how i sort things out 25:50

[@darksentinel082]

how i sort things out: 18:35

[@bloxxel]

I love how this implies you're neither boy or girl

[@TheLuckySpades]

Radix is actually a rather intuitively way to sort, you basically compare the different digits, first caring about the smallest and working up from there

[@Operational117]

alexander grimley That which has no life cannot be assigned a gender. I should know. I have no life, and thus I’m just a lifeless object. 🧱

[@falpsdsqglthnsac]

How I sort things out: 28:37

[@jazzy_jaymond]

10:22 this one gave me anxiety

[@leiph]

Jay Bivins well, it has LSD in the name

[@wladfan]

@@leiph Least significant digit

[@frogdaddystar9694]

It made me tilt my head

[@AlexKuz]

@@wladfan still LSD

[@aithrasherboi]

Unpopular Opinion (maybe): Bubble sort will always look freaking awesome no matter what.

[@treday9231]

I love your vids! Keep making them. (:

[@Musicombo]

Thanks!

[@safe-keeper1042]

I have no idea of what it's doing or why it's doing it, but watching it is oddly satisfying, so here I am. Also many of those graphics would make for nice loading screen backgrounds.

[@MetusMroczny]

Don't know why, but this is one of the most relaxing videos on YT for me.

[@Musicombo]

Thank you!!

[@DjSaiber]

6:08 my favorite part of the series: the tournament arc

[@Niscimble]

It's crazy how different the duration's of these algorithms can be. From 0.484ms (9:46) to over 8 seconds (12:00), even up to over 18 seconds (22:30)

[@m.h.6470]

you did realize, that the 18 seconds one actually only has 256 values, while the other two have 2048 values, right?

[@Niscimble]

@@m.h.6470 Yeah... so? What's your point?

[@m.h.6470]

@@Niscimble The point is, that you can't compare them directly like you did.

[@Niscimble]

@@m.h.6470 Why not? They are both sorting algorithms in a sorting algorithm video. Wouldn't it be even more surprising that the longest one has less things to sort?

[@m.h.6470]

@@Niscimble it's like comparing two motorcycles with a bicycle ... sure, you can do it, but it is stupid and doesn't really tell you anything.

[@sector_dgaming3936]

My grandkids listen to this soothing music every day. They are so happy they are jumping arround on the floor. Truly life-changing.

[@MilodicMellodi]

3:17 Oh, that's PAC-Man! Both visually and audibly. Interesting!

[@_KillerD_]

Wow

[@villagernumber7882]

Pidgeonhole sort: You're weak. Counting sort: I'm You.

[@00SNIVY00]

12:59 happy valentines day :v

[@Sub-no2sn]

dates a computer

[@echoes6092]

I notice that your dots are generated more often closer to the center-if you want a uniform circular distribution, generate them at a radius between 0 and 1 with a random angle, then for each point, take the square root of the radius. There's a marvelous proof that shows why this works that is too long to contain in the margins ;)

[@dunescapetube3470]

Ah nothing beats cottage life and sorting algorithms with the boys

[@trans-serif]

i can't begin to stress just how cool in-place radix lsd sort looks here

[@RogerGarrett]

In 1973 I took my first college course in programming, and one of the topics we covered was sorting. I recently checked the programming courses offered by our local university (University of Hawaii) and found that their introductory course includes sorting as a topic. WHY? No one in their software engineering career ever has to design a new sort algorithm. No one has to understand the techniques and issues involved. It's a long-ago solved issue. Programmers need merely select a sort library and call the appropriate methods, if they even ever have a need to do any kind of sorting. There are so many, MANY new and interesting topics that could be made part of an introductory programming course in order to expose the student to the basics of programming and to expand their interest in programming. So why oh why is sorting still part of the curriculum? It just boggles the mind.

[@Micksoffthings]

I leave this under every video I watched, it helps the algorithm.

[@dg6546]

May I ask how this visualize works? The distance between dots and center is their value but how to determine their coordinance in a 2d plane?

[@fearlessphoenix6566]

(v sin(2tπ/a), v cos(2tπ/a)) With v=dot's value, t=dot's position in array, starting with 0 a=array's length - 1

[@Musicombo]

You guys got it!

[@bammam5988]

It's using polar coordinates, which means instead of "x" and "y", you specify their coordinates as an angle "theta", and a radius "r". The radius is their value, and the "theta" is their position in the array.

[@carb0nus]

Counting and pidgeon sort be like: uhm, guys Tf are you doing? Just skip everything and draw the thing.

[@Orzorn]

I think Batcher's Bitonic Sort is my favorite out of these since it drew such interesting pictures.

[@Xyrenoxx]

cocktail shaker looks like you're closing an interdimensional rift

[@juliopchile]

Wow, the diference in speed between some methods is astounding.

[@ISTAREINURSOL]

12:59 I love you too batcher’s bitonic sort!

[@DukeOnkled]

What the hell is Silly Sort doing? Comparisons for the fun of it?

[@thechrisgrice]

It's doing its best.

[@amethystt727]

@@TheRealBatabii 22:30

[@amethystt727]

@densch123 that is bogo sort

[@signisot5264]

@densch123 That was the very last one with eight values. 22k comparisons, 102k swaps, 206k writes to array FOR EIGHT

[@DannySullivanMusic]

Ah yes, the classic swirl dot visualization. I see you are a man of culture.

[@svens3722]

came 2 times at 9:43 and 9:49... Could you tell me more about the draw function? Its the Golden Spiral i think but how to draw this? Is 0 in the MIddle or on Top?

[@-flxwly-1549]

You can draw this using a polar coordinate System. Instead of coordinates you have an angle and a distance. If you now Plot the index of each element as your angle and the value as distance to the middle or the other way you get something like that.

[@svens3722]

@@-flxwly-1549 i love you. thanks

[@VioletGiraffe]

I was just about to ask what kind of a spiral this is. Is it really a golden spiral?

[@TheVergile]

@@VioletGiraffe im on my phone right now so i cant check, but if you are curious just make a screenshot and measure. compare distance at 360 degrees with 270 degrees. if the ratio between them is phi its golden.

[@TheVergile]

for index and value pairs just do: map index values to angle: angle=2pi/maxindex*index map values to radius (or more correctly distance from center) such that growth rate is phi. (so over 1/2pi (90 degrees) the ratio of values is phi). radius=phi^(4*value/maxvalue) apply whatever scaling you need for desired spiral size. (this works for continuous values. if you have random numbers and want smooth spiral you need to pre-index them)

[@lukassjogren7910]

10:24 my brain trying to read social cues conclusion: oh god they’re probably mad :(

[@yaboy7744]

great, we have a program that can sort my spilled rice if i ever feel lazy

[@DatWingMan]

3:18 when a big orange ghost touches you

[@fachriem]

i wonder about the algorithm behind this kind of sort 9:47

[@jeroencuypers2703]

woaw this is so fascinating , the sound effect is also astonishing. i hope they make more of this

[@comradedanieru]

Girl: Hi My Brain: 10:23 Me: Potato

[@runthere100]

true shit

[@Anthony-cc7ws]

Random = funny

[@arknerem56]

mega lol xD

[@tactical_slime4608]

@@Anthony-cc7ws potato

[@theconduit21]

This is the visualization of what I program to do in terms of sorting for school. Glad to see this satisfying video.

[@NaviJ98]

Got this recommended after watching some touhou music Is this a spellcard attack?

[@liamgw9208]

Same

[@halfblood47]

Ahh, so basically galaxys are just trying to sort theirself with odd even sort...

[@coastersplus]

12:59 - Damn, Batcher's Bitonic Sort's lookin' THICC 🍑

[@caileg5664]

3:17 pacman death sound

[@zachrywd]

9:28 had me ROLLING!

[@Macintoshiba]

28 minutes of sorting. What is this, heaven?

[@BigEvy]

This came on auto play after an asmr video. Really interesting to watch, not so interesting to try and comprehend what in the hell I was listening to without knowing what this is !

[@gralha_]

Different methods to sort things

[@Frappuccinoo]

I love how stooge sort feels out the rest of the shape to make sure everything is in order at the end he wants to get the job done right

[@nathaos01]

7:13 i pretty much like this one the most so far :v EDIT: 9:53 found a better one (nvm 10:23) 12:16 yuuuup

[@toyama3307]

Other sort : *doing their best to make it under a second* Silly Sort : I'm trying to reach a minute here Slow Sort : It's in my name

[@solanumtuberosa]

As Frozone would say, WHERE IS MY BOGOSORT!

[@angelalen1615]

i sexually identify as a bogo sort

[@AlexKuz]

American flag: amma best Counting sort: hold my beer Pigeonhole: you're not allowed to drink beer yet, kid

[@TrizBoop]

*girls during puberty* : my period cramps hurt *boys during puberty* : 2:02

[@neurofitmusic1080]

3:19 the pac-man death sort

[@sitschi3949]

1:23 When the LSD hits

[@lilwyvern4]

I'll try and overexplain this video to people who may have found themselves here and are wondering what they're looking at. Anyone more knowledgeable, please correct any errors and I shall edit this comment. This video visualizes how computers sort information into a form humans can read easily, such as putting a list of names in alphabetical order on the screen. To the computer itself, this is a pointless step, but to the human using the computer, this is invaluable to ease of use. There are many ways to do this, but each has its advantages and disadvantages. The spiral of white dots is a visualization of each piece of data. Each dot could be a name, a number, anything that needs to be sorted. The data is sorted when it forms that nice spiral and stops moving. It turns green to show that the computer verifies that everything is in its proper place. The dots scatter around at the start of any demonstration just to show that everything needs to be organized. The red square that zips all over the place is whatever the computer is working on. Whether "working on" means putting a dot in its proper spot or just comparing it to another dot depends on the method of sorting and isn't that important to the video. The pitch of the sounds is based on the place in the spiral the dot goes. Higher tones are towards the outer edge of the spiral, lower tones towards the inner edge. Now what all the words mean: The first line, for example "Exchange Sorts: Dual Pivot Quick-Sort" explains the sorting algorithm being used. Don't worry if you don't know what this means, it's basically just a name. "2,048 numbers" refers to how many points of data are being sorted. Some examples have fewer than others for various technical reasons, mainly just how long it would take to visualize. "Delay" is how long the video pauses between what's being shown and how quickly the computer worked on it. For example, "0.08 ms" means the video took 0.08 milliseconds longer than the computer actually took to act just for the sake of you following along. "Estimated Real Time" is how long the sorting operation would take on a machine if it wasn't being slowed down for you. This is mainly so you know how long the sorting algorithm took to run. "Comparisons", "Swaps", "Writes to Main Array", and "Writes to Auxiliary Array(s)" refers to how many actions of each type the computer took. This is important depending on what limitations the system has. If these numbers are high, the algorithm might take less time, but use more electricity or memory doing its job. "Comparisons" are the computer looking at a piece of data and comparing it to another to see if they need to be moved. "Swaps" are when the computer internally changes its order. For example, this could be deciding whether an ace in a hand of cards is high or low. "Writes to Main Array" are how many times a computer moves a piece of data from once place to another. In a hand of cards, this would be physically changing a card's place. "Writes to Auxiliary Array(s)" are similar, but it would be like making a second (or third, fourth, etc.) hand to break the data into smaller, more manageable chunks. In a hand of cards, this may be separating each card by suit before putting it in order of rank.

[@BonesYouTube]

Why is the volume super low even on 150% volume

[@Musicombo]

Screwed up my OBS settings on this batch of videos. Oops.

[@BonesYouTube]

@@Musicombo oh ok maybe you can fix it

[@Musicombo]

@@BonesKZbin It's fixed in my later batch of videos!

[@dominiccairo9530]

I don't know what this is, but for some reason i enjoy it

[@AuroraVeil_]

Nobody: America on August 6, 1945: 3:18

[@theguyman256]

Oh god

[@piehunter1385]

Oh god

[@Inderastein]

Oh god

[@amarat.]

Oh god

[@Blochitect]

Oh god

[@ovalemulti3977]

me: you cant just show me something complicated on the midnight when i try to rest, because i havent slept for almost 2 days, trying to figure out the bugs happened in my code.. youtube: haha sorting goes ding ding..