Template talk:Sorting

This template does not require a rating on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Computer science This template 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 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}}

Why is th esorting network picture the same on all sorting sites? This does not make sense, as I actually thought it would depict the curretn sorting algorithm. I think it should be removed from the template. 82.130.79.176 (talk) 09:19, 7 July 2008 (UTC)[reply]

Jokeful is not a real word. 128.61.125.129 (talk) 19:41, 3 December 2008 (UTC)[reply]

Any reason why it's listed twice (under 'other' and 'exchange sorts')? Matttoothman (talk) 16:53, 7 May 2012 (UTC)[reply]

Looks like a mistake to me. Whether it's an exchange sort depends on how you do the random permutation part, but that's a reasonable enough place to leave it. —David Eppstein (talk) 17:51, 7 May 2012 (UTC)[reply]

While search algorithms have a category page , sorting algorithms have a template listing all entries. Maybe a category page for this template, or a template for all searching algorithms should be made... — Preceding unsigned comment added by 31.205.10.23 (talk) 21:46, 29 April 2015 (UTC)[reply]

According to the paper by Dijkstra^[1], smoothsort is of the exchange category. Right now I see smoothsort and heap sort in the selection category.

Wilhelmtell (talk) 21:05, 6 April 2016 (UTC)[reply]

Content-addressable memory is an alternative to sorting as are the analogue computing examples in the other section. 184.146.224.196 (talk) 12:47, 9 May 2021 (UTC)[reply]