Merge-sort with Transylvanian-saxon (German) folk dance

[@marti-nz]

Me: Why is my program running so slowly My PC:

[@maybudha]

😂😂😂👍

[@Q8Duelist]

Lol

[@g0nt4]

I either have a dance or you can sort it yourself.

[@TVSuchty]

technically, this dance would sort a big array faster than any bad sorting algorithm on your computer...

[@leslymx8150]

Hahaha

[@shim2dawg]

This is what it's like inside a computer

[@catc8927]

From now on, whenever I implement merge sort, I’m going to imagine my variables courteously bowing to each other as they compare values and gracefully taking their places in the right order. :D

[@jmckaskle]

Everything I know about European Folk Dance I learned from sorting algorithms. And vice versa.

[@sjs9698]

i'll take 'statements only ever made in the 21st century' for 100 please bob.

[@alexandrashvydun8726]

iconic

[@grammernazi2152]

You can literally half the time Complexity if you speed up the video by 2X

[@harshupreti1526]

Hahahahaha with 2x speed it will surpass counting sort 🤣🤣🤣

[@davidacosta5090]

Grammer Nazi If the runtime is n log n and you halve it to (n log n)/2 it will still equal to O(n log n) lul

[@yiliangliang5694]

Yes, but O(n) is an equal set as O(kn).

[@shapedsilver3689]

Technically no, that's just using a faster processor, which doesn't change the time complexity

[@rokosbrokos9420]

Does this only work with male and female integers?

[@BozGoalie]

+rokosbrokos no, it also works with male longs, and female double...ds.

[@alvaro1121]

otherwise, how can you... merge? teehee

[@istvankadar146]

Life is soo sexistttttt too... why only male and female can have children? It's soo unfair. We should protesttttt!

[@victorselve8349]

@@istvankadar146 I mean while it does take some help (and a surogate mother for the male) you could create an offspring between two people of the same gender although you'll of course be limited to a female if you do it with two girls. Also at this point I would advise you to GFP tag your child so you'll have an easier time to find it in a large crowd.

[@Rabbitsliver]

All humans have multiple ports *wink wink*

[@giorno_arijit3642]

Programmes :- ahhhhhhh ! Error code doesn't run ahhhhhhhh. [screaming in pain] Meanwhile in ram ... The code :- 🕺💃👯👯‍♀️👯‍♂️🪩🪩

[@CromemcoZ2]

Merge sort is my favorite sort, but now I'll always be troubled when I use it because some of the other sorts made prettier dances. :(

[@badis23]

CromemcoZ2mine too

[@nsajko1]

CromemcoZ2 It'd be better if they were allowed to dance in parallel ;)

[@loveforsberg530]

@@nsajko1 That is an awesome idea, but for a new series. There is quite the difference in how well sorting algorithms are parallellalizable.

[@alberto3790]

merge sort sux!!!!!!!! bubble sort 4 life !!!!!

[@programmingweekends6930]

It's actually the only merge sort algorithm video that really show how marge works. First divide every first half and combine any first half and step by step goes to the right and right and righter one. Most of videos make the division at the same time the do not consider that is recursive. Well done :)

[@shwetharamesh6701]

I don't think anything else has convinced me to binge watch sorting techniques.

[@moover123]

fine KZbin, I'll watch it again

[@jakx2ob]

TEILE UND HERRSCHE!

[@nikol8873]

i think they are saying 'teile und herrsche' (divide and conquer)... although there sure are ways to pronounce it a bit less harsh... sounds a bit like 20st century german

[@cathode5115]

Hungarian accent

[@ronniesunshine1163]

"divide and conquer" is the concept of the merge sort. Our prof actually explained it with those words specifically. Unfortunately she wasn't doing a European Folk Dance

[@samuelrussell9762]

I'd just like to thank AlgoRythmics for making this video to clearly demonstrate mergesort! I really feel like I understand how it works better, and I love the visual demonstration. Again, thank you for creating this awesome learning tool!

[@darkforcekiller]

I just realized that they say "teile und herrsche" which is german for "divide and conquer".

[@brownie6430]

Nazi core tbh

[@rezination]

I show this every semester to my Data Structures & Algorithms students. It makes it SO much easier to talk about how it works.

[@erivaldomouzinho2987]

man, look at that. so inspirational

[@nayutaito9421]

Wow, it's quicker than the quick sort!

[@RyanAtkinsC]

Couldn't be happier I found this channel. Keeps my attention so I can easily watch how it work.

[@ColoqueNombreAqui]

Art + Music + Logic + Sorting = This Awesome Video Thank you very much :)

[@hughcharlesparker]

This video is fantastic up to about 3:40. After that the dancers end up in pairs, which if you're not very careful gives a class the wrong idea about the algorithm.

[@georgevigne8976]

I concur completely

[@lover1301]

To become a professional in programming, make your mind always imagine things simple and fun

[@notebookled]

Finally I understand Merge-Sort. This video is solid gold.

[@david1311-c3f]

My Computer Science professor told us to watch this video to understand merge sort and im happy now

[@codrinamerigo3041]

Spectacular

[@sharifdilnewazhossain5833]

what an idea to present this merge sort technique...awesome....

[@wandersongomes8405]

Muito obrigado! Voces sao demais. Ajudaram bastante nos meus estudos.

[@ebon123]

i'm at the weird part of youtube again

[@xtfkpitube]

Super! You are the best professors

[@afghanischesKamel]

Can't be unseen.

[@corleonevito8020]

please do the heap sort too

[@sahirsujahudeen5558]

Unification of Germany colourised

[@clashlogs1854]

Amazing and beautiful

[@wimonalee]

OMG, NICEE! THANKS SO MUCH.

[@varunaggarwal7126]

Teacher:write an algorithm for merge sort. me: (*thinking*)what were the steps?

[@JZX619]

Wow excellent, better than the books.

[@CariagaXIII]

now do Bogosort lol

[@niggster]

I imagine Bogosort would be like a bloody Moshpit over and over again, until everyone dies from old age

[@TheTobeyGaming]

Do Harlemshake until sorted 🤔

[@ayamirisukahyejunghyuneuneun]

ouch ouch my feet are burning from dancing

[@mehdi_fadaei]

i am so happy to see my pc is so happy inside

[@DrupalAuthority]

Excellent!!

[@katnisseverdeen8481]

Amazing!!!

[@Tanlin2021]

this is awesome

[@attamjotsingh4474]

Love the video , best best best

[@chinagopireddyravuri4007]

Great 👏🏻

[@techgamer1333]

Best of All This one

[@khoihoang6838]

Very nice! Thanks

[@anabelberumen]

Amazing 🤩

[@sixthat]

The computer merged the divided arrays a[0...1] and a[2...4]. As the first entries in the respective sub-arrays are the lowest ones, you can simply compare those two to determine the lowest entry. If a[0]

[@TheBarta20]

muito boa essa iniciativa. very good this iniciative.

[@FrancisAzaliaGuerreroVelasquez]

This video is great!

[@melomanoymelifluo7794]

esa numero 2 esta buena creo que le reservare memoria dentro del arreglo de mi corazon

[@melancholiethelab9478]

im here just for the music !

[@59thbridge]

This is great!

[@kjfddfjk]

awesome!

[@trtrsqr4666]

This looks like the most useful (Monty) Python sketch ever.

[@marius8032]

"I don"t want to live on this planet anymore" - Prof. Farnsworth

[@PlainLazyZitu]

splendid!

[@merrimac1]

Genius!

[@HugoTeerds]

Wow! 😍 💯 ❌ 👍 ‼️

[@autumn33333]

Watching this single hits different 😢

[@ntuthukomthiyane5017]

great

[@howtoprogram4300]

I love this vedio..really awesome

[@canmetan670]

Haha this is awesome.

[@EsraaElGhoul]

amazing

[@juanikitro]

Genial

[@imvickykumar999]

This is what "Intel Potato Inside" Processor feels like.

[@jussipaivinen]

Weird but awesome!

[@DaBhaalspawn]

I clapped at the screen

[@datonewierdkid9362]

entertainment is the first step of learning

[@Cnidaria14]

helped a lot!!

[@Mahesh01993]

sorting took 4:16 min to complete

[@Spholx2]

Actually made sense for me :)

[@fraaggl]

you are sooo lucky, i'm like whhhooooootttt theeeeeeeeee fffoooooooooooook !

[@warren010h]

I already understand mergeSort but really enjoyed this demonstration of it :) That was interesting.

[@VArsovski10]

I understand the basic concept of things though - the list gets divided and divided and divided until each sublist contains 2 elements and they get sorted, and then after at the "coming back" cyclus - they are just linearly "compared" and merged providing both of them are already sorted.. And rince and repeat till the whole list is being itself the sublist.. Still - don't get it - why it is so that after the first 2 elements in all of the "sublists" get sorted the 3rd element gets "isolated" ?.. why aren't the 3rd and 4th compared immediately ?, but instead what we saw is - the third one getting "isolated" and the next step being - comparing the last 2 instead ?

[@ImmacHn]

Actually it's up to when there is only one element left, at that point the array is sorted(1 element is always sorted) then you merge.

[@randalthor7693]

'Rince' and repeat, awesome. "Rince" is the Irish word for "dance"

[@GrahamToal]

surely the subsorted lists should all stand in a line behind each other? (in file, not rank)

[@Aefan69]

ohhh now i understand what a merge sort is! :D

[@musi2411]

eu estou aqui... por causa de uma fanfic. não entendi caralha nenhuma, mas não consegui parar de ver

[@olavoalves9590]

Muito bom!!!

[@s.g.5318]

The last man was all sorted

[@bentos117]

radix sort next, please

[@auroragisela4807]

woow, smart - magyarok!

[@terrencemuradzikwa99]

nyyc wooow!!!

[@gouravrudrawar7823]

🙌🙌🙏

[@tetelim4428]

God bless mergesort

[@arleyigt]

Belíssimo!!!

[@handsomewj]

Hello from computational thinking

[@AyoubWissam]

C++ Arrays

[@beebumm]

@EvenSailorsCry But the correct term is indeed "divide and conquer", it's no correct translation, but the correct term.

[@Leon-pn6rb]

At 0:53 , Do the 2 left strings merge?

[@SS-yt4yd]

The left 2 elements are already sorted on that stage. And they are sorting a[2] to a[4] by merging a[2] and a[3-4]

[@wandersongomes8405]

Legal demais.

[@montane-ub9jc]

i have to say, did they dance compared with dancers in other videos?

[@4sterix]

Fanclub Prof. Georg Groh from TUM 🙋‍♂️

[@MemotoShikate]

Pozdrawiamy Pana Kędrę :)

[@Tylemaker19]

Mergesort is the most confusing if the basic sorting algorithms for me, how is this fast?!

[@falconJB]

To merge 2 sorted sub-arrays of size n/2 takes n comparisons, because each comparison will give you one item in place. Meaning that each layer of merge sort is O(N). And because you are merging sub-arrays in pairs it will take log2(n) layers to go from single items, which of course are sorted, to the full array being sorted. This means that you go through log2(n) layers with n comparisons in each layer, giving you a O(Nlog2(n)) for merge sort rather than the O(N*N) that you get with simpler algorithms. It also has additional benefits with large sets of data when it comes to paging.

[@TimurCalmatui]

+Tylemaker19 it's close to performance (and faster in some cases) to QuickSort which is far more confusing. MergeSort is quite simple and can be done in real life (parallelization is great too so you can have multiple people sorting :) ).

[@Freecell82]

This dance is a really poor example. I dunno if it showed the worst case, but it's not a good one. Mergesort is fast in the average case because you can just not do large parts of it. You're merging already sorted lists, so if you have n elements of list a remaining after all of list b has been merged in, you don't have to do any more comparisons.

[@cristiantironi296]

Qui grazie ad Angelo

[@Eww...NotTheHumansAgain]

OMG!

[@daniek_lubik]

Pozdrowienia dla Pana Kędry ! :D

[@somanshukadam1864]

This video's link is in my professor ppt.

[@fi1689]

I was blind but now I can see

[@channyeinkyaw9926]

lol awesome

[@leslymx8150]

Brutal!