Talk:Sorting algorithms

From Citizendium
Revision as of 18:54, 19 December 2007 by imported>Joe Quick (subpages)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
This article is a stub and thus not approved.
 Main Article
 Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
To learn how to update the categories for this article, see here. To update categories, edit the metadata template.
 Definition:  An algorithm that sequences elements of a list in a certain order. [d] [e]
Checklist and Archives
 Workgroup categories:  Computers and Mathematics [Categories OK]
 Talk Archive:  none  English language variant:  American English

The article should be organized differently

I think it would be far better to organize the different sort algorithms under general classes of algorithms like Divide and conquer, Greedy methods, and similar. Or perhaps the complexity.

Also, not all implementations of quicksort perform swaps.

Also, AFAIK, "Hash-sort" is the most common term for what the article terms "Sorting by Distribution".


Ragnar Schroder 14:02, 15 November 2007 (CST)

Retrieved from "https://citizendium.org/wiki/index.php?title=Talk:Sorting_algorithms&oldid=338294"