Sorting Algorithms As Dances

mikejuk writes "You may well have seen many simulations of sorting algorithms that aim to show how the algorithm works. However I guarantee that you have never seen anything quite in the same league as the videos made by Sapientia University — they are simply crazy but in the nicest possible way. They folk dance their way though bubble sort, shell sort, insertion sort and selection sort. Very, very weird but you find you can't but help checking that they are doing it right. Now anyone want to try quicksort?"

Comments

They tried bogosort...

[dgatwood]

...but it was indistinguishable from a bunch of drunk guys stumbling around in a crowded SF Muni station.

parallel versions

[Odinlake]

I'd love to see parallel versions.. Much more action that way. Confusing? I think it could be beautiful.

Re:5 minute video

[plover]

That's why we use computers for algorithms. Neat idea though.

See, that's what you get with interpretive dance.

A compiled dance would be much more efficient.

Re:5 minute video

[martin-boundary]

Did you notice that the comparison function is actually polymorphic? For example, the dance steps are different when comparing two guys and when comparing a guy and a girl.

So really, even if you compile the dance, I think you'll find that the dynamic binding overhead will kill the running performance.

Had it at school already

[alonz]

My intro-to-CS professor (20 years ago... my, how time flies) used to illustrate sorting algorithms by sorting the students in class by height.
Once someone participates in a sorting algorithm, they sure won't forget :)

Re:Where is the quick sort or merge sort dances?

[zippthorne]

Yeah, there's never been any kind of line dance where the dancers split into two groups, do stuff, and than merge back into the larger group in some ordered fashion....