Sorting Algorithms As Dances 68
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?"
They tried bogosort... (Score:5, Funny)
...but it was indistinguishable from a bunch of drunk guys stumbling around in a crowded SF Muni station.
Re:5 minute video (Score:5, Funny)
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 (Score:5, Funny)
So really, even if you compile the dance, I think you'll find that the dynamic binding overhead will kill the running performance.