Open main menu

Commons:Featured picture candidates/Image:Sorting quicksort anim.gif

< Commons:Featured picture candidates

Image:Sorting quicksort anim.gif, featuredEdit


  •   Info created by en:User:RolandH - uploaded by Howcheng - nominated by Calibas --Calibas 02:54, 27 October 2007 (UTC)
  •   Support --Calibas 02:54, 27 October 2007 (UTC)
  •   Support Lovely. --carol 05:20, 27 October 2007 (UTC)
  •   Support This animation illustrates the concept of a quicksort, which is complex for many, perfectly. Freedom to share 13:25, 27 October 2007 (UTC)
  •   Support --Beyond silence 14:10, 27 October 2007 (UTC)
  •   Neutral great animation, but I will support it if it is slowed down....--Tomascastelazo 15:25, 27 October 2007 (UTC)
  •   Support --Bergwolf 17:07, 27 October 2007 (UTC)
  •   Support. <3 -- Cat ちぃ? 17:23, 27 October 2007 (UTC)
  •   Neutral - Agree with Tomascastelazo: great animation but too fast, even for those who already know the algorithm - Alvesgaspar 18:43, 27 October 2007 (UTC)
    • I think it goes too slow from something called quicksort but I see your point. Calibas 18:58, 27 October 2007 (UTC)
  •   Support --Böhringer 22:00, 27 October 2007 (UTC)
  •   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. -- Slaunger 22:33, 27 October 2007 (UTC)
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. -- carol 05:45, 28 October 2007 (UTC)
  •   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. --Ronja 18:48, 28 October 2007 (UTC)
  •   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)
  •   Support extra ! DocteurCosmos 13:06, 29 October 2007 (UTC)
  •   Support Good.   Richard Bartz [[*  Support - User_talk:Richard Bartz|talk]] 20:01, 29 October 2007 (UTC)

Noumenon talk 00:04, 30 October 2007 (UTC)

  •   Support It is good. Lycaon 05:21, 30 October 2007 (UTC)
  •   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. Samulili 08:01, 30 October 2007 (UTC)
result: 12 support, 1 oppose, 2 neutral => featured. Cecil 03:35, 6 November 2007 (UTC)