Select-sort with Gypsy folk dance
Uploader Comments (AlgoRythmics)
Top Comments
-
You folks, these videos are the most awesome thing ever. I'm a Balkan musician in the SF Bay Area and also a software engineer. I'm sending it around to all my bandmates... Also bravo to your fiddler, he or she is quite good.
-
Goodness! Lovely performance by the dancers and musicians, but the algorithm's O(n^2) best and worst case performance was terrible!
All Comments (42)
-
@AlgoRythmics Can you improve it to heapsort?
-
Pero qe coj....!!
-
I Love This :))
-
Гениально! :)
-
an O(n^2) algorithm speed up to O(n log n ) with the fast forward button.
-
For the first time I have a genuine understanding why we should avoid using selection sort.
-
mer gyorsitotak fe??
-
I think you don't need to swap elements on each iteration, when you find that current element is less, you need just return original candidate to it's place and enable dancing for "new minimum" element and after reaching the end swap minimum element and element on it's place.
-
Que ótimo!*-* (How great!)
Merge-sort with Transylvanian-saxon (German) folk dance, and quick-sort
with Hungarian (“Küküllőmenti legényes”) folk dance will be uploaded in few
days. We are developing a software tool that didactically exploits the six
dance-performances. This software will also be available soon.
AlgoRythmics 10 months ago 17