Classical Sorting Algorithms Implemented in Hungarian Folk Dance
Posted on July 25th, 2011
by Alex Rickett
This dance group decided to implement classical sorting algorithms through Hungarian Folk Dance (incredibly inefficient and their particular implementation only has 8 bytes of memory but entertaining nonetheless) for your general edification. They’ve implemented classics like merge-sort, quick-sort and shell sort (a turtle free version of the favourite bubble sort). Check them out here.
Of course, if you’d like to read more into sorting algorithms whether for game design or just general knowledge we highly recommend reading through the Wikipedia page on sorting algorithms, particularly spaghetti sort (linear time complexity!) and stooge sort (worse than bubble sort but it’s funny!).