[Michael26]

There is more on that channel, interesting way to learn sorting algorithms

[jon.kiparsky]

Those are some brilliant videos, I have to say.

[unknown500]

I finally understand sorting algorithms! After all those data structures classes, and all it took was a couple videos of people dancing.

[baavgai]

Wonderfully amusing. Those are some devoted computer geeks. Though, number 8 turned his back too soon in the bubble sort...

I've animated sorting algorithms before. Numbers with happy feet, however, is quite an improvement.

[jon.kiparsky]

I like to think they were just a dance group who was hired for a gig. I have no idea whether it's true or not, but the image is irresistable to me - "what on earth kind of dance is this, anyway?" "I don't know, but the money's good - just have fun!"

[Michael26]

Imagine how long the video would be if there were more than 10 elements(like 1000 )

[Ryano121]

It would all depend on the sorting algorithm they used

[jon.kiparsky]

Michael26, on 19 March 2013 - 02:18 PM, said:

Imagine how long the video would be if there were more than 10 elements(like 1000 /> )

Video, nothing. That's a dance party you've got there!

Quote

It would all depend on the sorting algorithm they used

And if they used quicksort, on whether they fixed their pivot selection.

[baavgai]

Ryano121, on 19 March 2013 - 02:24 PM, said:

It would all depend on the sorting algorithm they used />

No. It would depend on the dance used...

This post has been edited by baavgai: 19 March 2013 - 03:00 PM

[#define]

Ah, programmers' parties. Now we have proof that the bubble sort is faster than the quick sort.

[jon.kiparsky]

For n = 10, yes. This is why we have to run the all-night dance party/experiment, to see how they scale...

[depricated]

jon.kiparsky, on 19 March 2013 - 08:07 PM, said:

For n = 10, yes. This is why we have to run the all-night dance party/experiment, to see how they scale...

FOR SCIENCE!

[h4nnib4l]

jon.kiparsky, on 19 March 2013 - 09:07 PM, said:

For n = 10, yes. This is why we have to run the all-night dance party/experiment, to see how they scale...

For a given Hungarian folk dance...

[carnivroar]

As soon as I read the title I guessed what it was. My professor showed it to me once.

[jon.kiparsky]

h4nnib4l, on 21 March 2013 - 08:29 AM, said:

jon.kiparsky, on 19 March 2013 - 09:07 PM, said:

For n = 10, yes. This is why we have to run the all-night dance party/experiment, to see how they scale...

For a given Hungarian folk dance...

I think we'll find that there is no combination of folk dances that makes the bubblesort dance party end before the quicksort dance party for large populations of dancers. However, we should surely run the experiment. All we'd need is a good Hungarian band and a large supply of pálinka and a few thousand dancers.