File talk:Sorting quicksort anim.gif

This file is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

File

This file does not require a rating on Wikipedia's content assessment scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Wow, fantastic animation. I think it should be nominated as a featured picture. --LesPaul75 06:14, 10 January 2007 (UTC)[reply]

I agree, awesome animation. --Lukas Mach 17:17, 6 February 2007 (UTC)[reply]

Did this picture ever get nominated?

I must say, very informative! - Ta bu shi da yu 08:35, 12 June 2007 (UTC)[reply]

This animation has been nominated and accepted as a Featured Picture. Here's a moving picture that's worth several thousand words ... it's a brilliant piece of work. Thanks, RolandH! CWC 16:35, 12 June 2007 (UTC)[reply]

I'm liking it, but does it have to use a continuous set of increasing values? It could be a misleading about what the quicksort does. Perhaps a pair or two of equal values should also be included to demonstrate the response of the algorithm to these. I know the image just gained and deserves FP status, but I know that I'd support a transferral to one with a more varied dataset if it were created, as this would be even better. BigBlueFish 14:08, 13 June 2007 (UTC)[reply]

I was thinking the same thing. How does the algorithm handle equal values? Foraneagle2

The Quicksort algorithm actually keeps track of three lists - values lower than the pivot, values equal to the pivot, and values greater than the pivot. It then (recursively) sorts the first and the last list, and then it concatenates the three lists, which is the return value. --MathiasRav (talk) 16:34, 23 November 2007 (UTC)[reply]

Please add a link to Quicksort on the image's description page. Solitude\^talk 08:30, 27 October 2007 (UTC)[reply]

Source?[edit]

Is the source for this image available? If so, could a similar image be made for the merge sort? silly rabbit (talk) 19:15, 3 May 2008 (UTC)[reply]

File unavailable?[edit]

This file seems to have disappeared, although on several pages it is still visible. For example, on Computer Engineering it is unavailable, yet on Quicksort it is visible. Bakkster Man (talk) 18:51, 6 July 2010 (UTC)[reply]