Quick-sort with Hungarian (Küküllőmenti legényes) folk dance
Вставка
- Опубліковано 1 тра 2011
- Created at Sapientia University, Tirgu Mures (Marosvásárhely), Romania.
Directed by Kátai Zoltán and Tóth László.
In cooperation with "Maros Művészegyüttes", Tirgu Mures (Marosvásárhely), Romania.
Choreographer: Füzesi Albert.
Video: Lőrinc Lajos, Körmöcki Zoltán.
Supported by "Szülőföld Alap", MITIS (NGO) and evoline company.
Click the link below to watch this visualization included in the AlgoRythmics Universe:
www.algo-rythmics.com/Algorithms
Interviewer: ”Please, dance a quick-sort.“
Oliver Portee lol
uses shadow jutsu to create the array element dancers
Now we're prepared for that one
You made my day 😂😂😂
Lol from Pakistan
I just realized that my 30 years in computer science has been solely so I could laugh today watching this.
I've been in cs for 6 months and I can laugh too
no one cares
@@Spartakus1919 Hey Jack, Fuck yourself you salty git.
Ok that's a mood
Jack Hancotte yeah what the fuck, Jack! Not cool, man, not cool!
This is what actually goes down every time your computer sorts
Bu Computers do it with no music nor dancing, which is why I don't like computers doing it.
I laughed way to hard at this comment haha
Well, no, but actually, yes.
We're gonna need a bigger heatsink
Guy: - What architecture do you use? -
Me: - *Hungarian folk dancers* -
That ALU is so slow. Comparison operations are taking at least 8 boot twists and hand claps.
TrippedOverShoelaceException
What?
It's a computer science joke :)
Made me laugh XD
Missing file boot.dat
Lol I laughed so hard I woke everyone in my dorm up
You can overclock it by changing the video speed xD
Yago T underestimated comment.
True! Awesome!!
Or by ordering the band to change tempo
Nobel fucking prize in computer science
Toms Mucenieks lol didn’t expect to find you here.
Exposed as a nerd!
A video that fulfills a specific niche i didn't think existed: comp sci students that
• don't wanna live anymore
• are awake at an ungodly hour
• have no other options left
• have their final on sorting algorithms tomorrow
• have only two functioning brain cells left, and
• like hungarian folk dance.
I'm just taking a shit with my phone.
I am not
-a comp sci student
-awake at an ungodly hour (at the moment)
-out of options
-getting any sort of 'final' for a couple of months
-down to 2 brain cells
- a fan of Hungarian folk dance
TLDR; everything that you just said is incorrect in my case
That's a very tight Venn diagram
I feel directly attacked
@@drawsgaming7094 I am a little bit concerned you didn't cross out "don't wanna live anymore"
Wow, even slower than bubble sort, Hungarian folk dancers just just aren't a good architecture for running sorting algorithms.
+Jeremiah B You made me chuckle. Well done. :)
+Jeremiah B U wot m8? Didn't you see select sort? Those guys optimized it by modifying space-time.
+alqacer alqacer you probably dont understand the joke..
+Jeremiah B
i have 2.0 now, which features female dancers.
it processes not really faster, but it is more entertaining while you wait.
andras grof is angry.
What the dancers shout: "divide and conquer" :3
Thank you!
no way haha, that makes the video kinda perfect :D
That's awesome
And all that in O(Hungarian * log(Hungarian) ) time.
Is this Hungarian notation?
hungarians
I think you mean Hungarian Hungarian log * O
By the speed of this, more like O(Hungarian^2)
@@SZ-wt3nk or even O(Hungarian^Hungarian ) :O
This is... by a wide margin... the nerdiest thing... I've ever seen... in my whole life.
+Ambit10n9 I was deeply touched by these videos.
You might want to step out of the trailer park every now and again...
@@juliusg.farkas2188 don't be so rude!
@@alejandrocanalesgonzalez2851 I was being nice
Then you haven't seen ua-cam.com/video/2rjbtsX7twc/v-deo.html
This is so much better than hours of lecture in my university
Are you really sure about this?
Well. My programming professor showed us series of those dances at the lecture :D
Ideally, that's how teaching should be in general. Entertaining and informative. But few teachers have enough passion, time and are payed well enough to do so...
So quicksort:
Once you got both hats, you know you are in the right position.
*spoiler*
correct order is 0,1,2,3,4,5,6,7,8,9
Not on my keyboard :q
COME ON DUDE REALLY
Dude are you serious right now, you're just gonna come out and say that?
everybody dislike this
That's amazing, I've got the same combination on my luggage!
it is funny, that the quick-sort video takes ~7 minutes however the bubble-sort video only takes ~5 minutes :D
Quicksort is quite effective for big data arrays but it's not good for small arrays. That's why functions like std::sort use other sorts for small arrays (including the last calls of the quicksort).
@@dmitriymiroshnichenko418 Was about to comment the same ;)
Well, the bubble sort was run on a machine with higher Hungarians per second. It also had a pretty lucky starting permutation.
No multi-threading? Come on, optimise your dancers already!
i was wondering the same thing. it would be cooler with multithreads
@@SudiptoChandraDipu Perhaps in a part 2?
You mean multi-treading?
@@martian17
You don't need that to demonstrate algorithm, if you pull in ABI and stack frames it will start to look silly
For multi threading the men have to be replaced by women.
I should re-consider hungarian notation.
finally somone wrote it down
I wish the Hungarians were multithreaded :(
What?
+Zoltan Csikos This is a bit late, but from Google:
"In computer architecture, multithreading is the ability of a central processing unit (CPU) or a single core in a multi-core processor to execute multiple processes or threads concurrently, appropriately supported by the operating system."
This means that Kody Kurtz was making a joke about how this process could go faster if instead of only one array being sorted at a time after the array is divided, all arrays continue the process at the same time. It would be harder to keep track of visually, but the process would be much faster.
Edit: Google is not a sentient being... at least not yet.
they would be faster if, after they split up, both groups could continue simulteneously.
Performing a sort method from multiple threads would be a disaster. That would be like all the dancers collapsing in a heap and the stage exploding.
Any well designed divide-and-conquer strategy (of which Quicksort is an example) can (relatively) easily and safely be parallelized. That's kind of one of the major advantages of divide-and-conquer methods.
I'm a software engineer and this makes me weirdly comfortable.
sem xD
I will now picture all of my data as Hungarian Folk Dancers.
All your data belong to dance!
all your Hungarians are belong to dance
I wish the numbers were all 1s and 0s
Now I'm imagining object-oriented programming as a bunch of Hungarians all tied together with rope, dancing in tied-up groups
Probably the best way to remember. I keep on forgetting quick sort and shell sort. Interviewers ask these questions at every level unfortunately.
I love it when things are explained through Hungarian folk dances. Just love it.
The UA-cam algoritm made a good guess this time
Totally agree
Yep
I was summoned
That’s because the algorithm is run by 10 dancing Hungarians
I cannot believe I actually watched this whole thing.
And now I can't swipe this stupid grin off my face.
I AM NOT A NUMBER I AM A FREE MAN !
"Dear Candidate, could you do me a quick-sort in situ?"
"We will need a larger meeting room for that..."
Wow, this helped me understand how quicksort works way better than the tutorial video I just watched
Visualization always helps...
So tired of being a pivot LOL
Although it looks a tad inefficient(thanks to the forever taking comparisons), this is probably the most amazing sort explanation I've ever seen. Also the best use of folk dance. Kudos!
how, it doesn't explain shit
@@Merthalophor it does if you know generally what you're looking at
Şimdi aynısını zeybekle yaptıklarını hayal et
@@Merthalophor Why did it give up on the first sort method and start grouping?
@@snap-off5383 the groups are guaranteed to be within a certain range after the initial sort. For instance in this video, after the 3 has been placed, we know for sure everything to the left of it is lower and everything to the right is higher. The point of using the groups, then, is to guarantee that we're not double-checking that 1 is less than 4 when we know that 1 is less than 3 and 4 is greater than 3 just because of where they are relative to the 3 after it's been placed.
The two parts of my life that I never thought could possibly overlap. But, youtube has never been more right - I doubly enjoyed this.
Well I sort of like this.
You might live in a bubble, so don't make up your mind that quick.
It seems you like kinda sorta like quicksort like sorting techniques
most awesome quick-sort explanation ever :)
Classmates in Data Structures exam: "Ugh, I don't understand this, I should've gone to lectures, why am I even doing Computer Science?"
My mind in my Data Structures exam:
Now do Bogo Sort
Or spaghetti sort with real Italians :)
BOGO Sort with Mosh Pit Dancers
My professor really gave us this video and said "homework is to implement this in python". I love it!
lmao yea
Looks like a class project for Algorithm and Dance graduate course.
Looks like a CS student was minoring in Dance and had to do homework for two courses at the same time
I saw this clip a year ago as I learned programming in java! Today my teacher gave me this challenge and I didn't know anything about this algorythm but I remembered about this video and it saved my ass! :D
Awesome video, thanks! >)
Why am I watching this I have an exam in 2 hours...
I think you just answered your own question.
Was it an exam on sorting algorithms?
God bless you!
me too :))
How was your exam?
Man! This is exactly why I love youtube!!!!
Hype for Hungarian-bit processor?
Had their height/something matched their numbers I would have cried... ;-)
After 1:48 the sorting process can be paralleled.
but that's does no happen in the basic algorithm, it needs to finish one half to do another
Joao Vitor Lustosa Not if you multithread
@@oshotz "BASIC ALGORITHM"
The BEST EVER explanation of how quick sort algorithm works
maa kasam nailed it, in my 3 years no lecturer tought the quick sort this way, this is a better explination
this is one of the best things I've ever seen in youtube
6:18 How your solitaire cards feel when you finish a game
Game over. This wins the internet.
Now do bogo sort
Jan Jappie lmfao
Okay seriously where do we sign up for lessons to dance like this? I've watched this clip like 15 times already it's THAT entertaining.
There's a youtube channel called folk otthon, you can find several tutorials there /but only in hungarian :(
Commentary of my professor about Heapsort: Its runtime is optimal but the Hungarians can't dance it (=It's not intuitive) XD
You are underestimating the power of hungarian dance my friend. ua-cam.com/video/Xw2D9aJRBY4/v-deo.html
You are underestimating the power of hungarian dance my friend. ua-cam.com/video/Xw2D9aJRBY4/v-deo.html
this never gets old
bojler eladó!
This is sooo great - Art meets Science. Yeah Baby!
I'm not sure if you meant it to be so, but I read the 'Yeah Baby!' part in an Austin Powers voice haha
This is awesome. Must watch for people interested in algorithms.
Not a comp sci major, don’t even know a thing about computers, but I watch a lot of those mesmerizing sorting videos. This is by far the best suggested video I’ve ever received.
I don't know what's worse, that people put the effort in to make this, or that I've watched it enough that I understand quicksort now
2011 UA-cam:
2019 UA-cam: hey check this out m8, you’ll love it
What a masterpiece lol
No one:
Not a single person:
Literally nobody:
Hungarians: oLAf, lET uS dÖ qüÌCk SOrt tØGËthèr
They literally played this in a lecture at uni and put it as a link on their website.
This was the highlight of this term.
_meaning I am doing research that was recommnended by my uni here. No excuses_
it really took me seeing a video of a hungarian folk dance quick-sort to realize that everythings gonna be ok
This is exactly what's going on in my head when I'm sitting in class trying to pay attention to my professor explain Quick Sort.
Thank you, you wonderful and multi-talented nerds, for helping me get through my exams!
i come back to this regularly and i absolutely adore it thank you so much
I did not know I needed this until now.
I wouldve loved if they were a reverse ordered list and just see them dancing for hours
haha yes, the worst case!
My last 10 brain cells on my sorting algorithms test:
I knew there was a reason UA-cam has been recommending me, a lowly art school drop out, sorting algorithm videos for the past 2 years
This video taught me quick sort better than three years of CS classes.
When can we expect to see Turing machines explained on a hungarian csardas?
How QuickSort Algorithm works, explained with Hungarian national dance =)
So much fun! Enjoy :)
#quicksort #algorithm
Probably the best ways of teaching algos.. You guys are amazing.. Keep up your good works❤️.. Want more videos like this
This is awesome ! Whoever thought of this,was a genius !
That's the slowest quicksort implementation I've ever seen.
Nobody:
December 2019 youtube recomendation algorythms:
Yeah, you must see that hungarian single-core sorting dancing machine from 2011.
I wonder if they try division by zero dance)
Literally, the best thing ever. thanks so much Romania. You've done the world a favor.
Yes, enjoy it !
I love to watch these guys dance ! It's so much more comforting than looking at powerpoint slides. xD It's amazing how good their choreography is and their dancing in general. Very nice!
This is more than perfect, but how many times did you have to shoot it. It is a very long one take video.
*clicks on video* oh no this is gonna take forever... *sits through it all*
Thank you to the UA-cam algorithm for deciding to show me this video! I studied mathematics for a month in Budapest in 1998. This is beyond words so fantastic.
look at all those funky numbers doing a little dance! i love them lots and lots!!
*watches 5 sorting algorithm videos*
UA-cam 9 months later: ok watch this now
Fantastic. Congratulations. : )
I really couldnt resist hitting the like button and shouting that it is the best video that I ever came across to learn about quick sort :):):):) A big thankssssssss !!!!!
Wow I finally figured out why this tune starts playing on my computer when I sort columns in Excel !
play it 2.0 times the speed :p
quick quick sort
I second this
Please do folk dance with Bogo Sort :D
They are Gems... Never Imagined someone could come up with such creativity
I can't believe that it was a video with Hungarian dancers that made it click for me. Kudos to whoever came up with the idea!
When the teacher says to order by last name.
Not a very good implementation of quicksort. Looks like they picked the leftmost element as the pivot point. If the list was already sorted when they started the dance it would have taken even longer!
Didn't they need to take the leftmost element as the pivot in order to free up a space in case an element gets compared "low"?
Workaround for already sorted or almost-sorted lists: Do one round of BogoSort before beginning QuickSort.
Robert Lozyniak Yes they need to pick the rightmost or leftmost as pivot for an in place quicksort implementation.
I can no longer forget quick-sort. Damn it.
Just one day searching sorting algorhitms and now I have full main page of stuff like this
How
Why
But most importantly
Of course
Nobody:
UA-cam: Hey, m8 I sure u want to watch sorting algorithm in Hungarian folk dance video back from 2011
Szórakoztató. Egy nagyszerü módja annak. Nagyon köszönöm!
So when all your elements start dancing at once you know they are sorted and happy.
*When you're a computer nerd AND a dance nerd*
Doesn't seem so quick
Average O(nlogn) comparisons. The quickest we can get right now on single core ;) .
In a production implementation the music is much higher tempo & the dancing is quite frenzied.
To electronic music, naturally.
I can feel their bliss when each got both of the hats, found his place and can rest peacefully. (15 years of CS here)
It's 5 minutes to midnight. I have to wake up in 6 hours. And God I can't stop watching...