Jump to content
Wikipedia The Free Encyclopedia

Talk:Sorting algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the talk page for discussing improvements to the Sorting algorithm article.
This is not a forum for general discussion of the subject of the article.
Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL
Archives : 1, 2, 3 Auto-archiving period: 12 months
Other talk page banners
Former featured article candidate Sorting algorithm is a former featured article candidate. Please view the links under Article milestones below to see why the nomination was archived. For older candidates, please check the archive.
Article milestones
DateProcessResult
August 30, 2004 Featured article candidate Not promoted
This level-5 vital article is rated B-class on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:
WikiProject icon Computer science Top‐importance
WikiProject icon This article 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
Top This article has been rated as Top-importance on the project's importance scale.
Things you can help WikiProject Computer science with:

tk pic

[edit ]

What is the point of the tk screenshot at the top?? —Tamfang (talk) 00:46, 21 April 2023 (UTC) [reply ]

Seeing no response ... —Tamfang (talk) 04:52, 3 November 2023 (UTC) [reply ]
I agree that it wasn't very good. But I think something should be there. Do you see any good ones at Category:Sort algorithms? Perhaps File:Visualization of Gnome sort.gif Bubba73 You talkin' to me? 05:29, 3 November 2023 (UTC) [reply ]
Perhaps an animation of a less stupid sort. ;) Heapsort or Quicksort for example. —Tamfang (talk) 06:23, 3 November 2023 (UTC) [reply ]
There are some better ones at the Wikimedia Commons: Category:Animations of sort algorithms, see this Bubba73 You talkin' to me? 06:31, 3 November 2023 (UTC) [reply ]

AI Sorting

[edit ]

Just wondered if AI sorts should be added:

GrahamHardy (talk) 16:42, 23 June 2023 (UTC) [reply ]

By which I guess you mean improved algorithms recently discovered by AIs. If they are novel concepts they ought to be listed, but the videos seem to say they are speedier versions of known approaches. (I'll try to read the articles linked under the first video.) —Tamfang (talk) 23:45, 18 July 2023 (UTC) [reply ]
The DeepMind AI sorting algorithm targets sorting 3 to 5 elements and in the case of 5 elements, saves one compare. Not much of a breakthrough. Rcgldr (talk) 07:38, 24 July 2023 (UTC) [reply ]
That could potentially be significant if it is in a recursive divide-and-conquer algorithm. Bubba73 You talkin' to me? 05:36, 3 November 2023 (UTC) [reply ]

Table visibility

[edit ]

In the Sorting algorithm#Comparison sorts, quite a few parts of the text on the table are quite hard to see in dark mode. {{mvar }} seems to get the colours right though. Will try to find a work around. APenguinThatIsSilly ("talk" ) 00:23, 14 January 2025 (UTC) [reply ]

Currently, it looks like just the latex stuff is still rendered in white on top of pastel colours. I recommend following: In HSL colour space, invert L in dark mode for table colours. This is probably a better highlighting mode for dark pages. 2001:56A:711D:4500:2593:91E0:95DF:B7C (talk) 22:07, 31 August 2025 (UTC) [reply ]

(Multiway) Powersort

[edit ]

Powersort is an improvement on Timsort and has replaced it as the default sort in CPython. Moreover, multiway Powersort is probably even faster and can plausibly claim to be state of the art. Can we find room for one or both in the comparison table? 98.114.142.14 (talk) 05:06, 22 July 2025 (UTC) [reply ]

AltStyle によって変換されたページ (->オリジナル) /