Talk:Quicksort/core implementations
From Wikipedia, the free encyclopedia
Contents |
[edit] Purpose of this template
For some reason, people have an overwhelming urge to add implementations of sorting algorithms in every conceivable language. Once upon a time, the quicksort article's "Implementations" section was five times as long as the rest of the article put together. To deal with this, most of these implementations were moved out to quicksort implementations, a comprehensive list of quicksort implementations, leaving only a few representative ones in the original article. However, because we also want those few representative ones in quicksort implementations, this created a fork where the two articles diverged. This template is placed in now placed in both articles to prevent this divergence. It has the nice side effect of making it harder to edit the core implementations than the "additional" implementations, since people are continuing to add too many core implementations. Deco 00:22, 29 November 2005 (UTC)
[edit] Why no Java?
For those wondering why I haven't included the Java example here, despite the widespread use of Java, this is because it's for conceptual purposes nearly identical to the C/C++ versions. The C++ version at least generalizes the C version substantially, so I felt it was different enough. The Java version can still be found in quicksort implementations. Deco 03:19, 29 November 2005 (UTC)
[edit] See also
[edit] Should we delete this template?
I noticed that Quicksort has subst-ed this information instead of transcluding it.
Note that Wikibooks:Transwiki:Quicksort implementations continues to contain a link to this template. (It is not a transclusion, as it is not possible for a Wikibook to transclude a Wikipedia template.) --Kernigh 05:11, 23 April 2006 (UTC) (same as Wikibooks:User:Kernigh)
