Comment This is a very good idea, but it is way too fast to understand, even when you know the quicksort algoritm. However, if you slow it down the animation it will take too long I fear. The audience would be bored. Could the same point not be made with half as many bins while still getting the point? I think I would support such a version. It would by the way be very cool to see the same downscaled animation illustrating the more straightforward but way more inefficient Bubblesort alorithm. Just seeing that the animation takes longer time would be a clear illustration of the different efficiencies of those two algorithms. The (as far as I recall) equally efficient Heapsort algorithm could also be interesting to illustrate. -- Slaunger22:33, 27 October 2007 (UTC)[reply]
A computer animation like this is not like so many things that you might only see one time and perhaps never see it again or see it again decades later. I watched it run through its routine a few times before I voted. Consider that the speed of this animation might be perfect as it it because of the nature of the format to replay. -- carol05:45, 28 October 2007 (UTC)[reply]
Support The speed is good: the first watching does not get boring and the animation can be watched again (likely after reading a description of the algorithm) for better understanding. --Ronja18:48, 28 October 2007 (UTC)[reply]
Support Very good.A beautiful picture is worth a thousand words/Un beau dessin vaut mieux qu'un long discours -- Walké20:16, 28 October 2007 (UTC)[reply]
Oppose unnecessarily large and therefore complicated for me to understand. I never really got the idea behind quick sort in programming class and this doesn't help me. Maybe a bit too fast, too. Samulili08:01, 30 October 2007 (UTC)[reply]