Talk:Sorting algorithm

There is nothing wrong with worst case time complexitiy

(n²/2) - (n/2) IS O(n²)

BULL

This "page maker" is deleting or mis-representing code for faster sort algorithms. Never stating where they came from or sources. Giving confusing explinations for advanced algorthms and leaving out practical issues such as found in unix sort(1) (ie, stability, tape v. memory, caching). Deleting sumbitted old and new algorthims (ie, mine but others). But has publishes "timsort" which is a joke algorithm. Say he has a tester and all algorithms but has no evidence of having the same. And the sources cited have 0 to do with the origion books and creators of the algorithms.

tk pic

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

Seeing no response ... —Tamfang (talk) 04:52, 3 November 2023 (UTC)

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)

Perhaps an animation of a less stupid sort. ;) Heapsort or Quicksort for example. —Tamfang (talk) 06:23, 3 November 2023 (UTC)

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)

AI Sorting

Just wondered if AI sorts should be added:

• https://www.youtube.com/watch?v=n2qCry_o2Fs
• https://www.youtube.com/watch?v=nF81NVBFLcE

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

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)

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)

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)

Table visibility

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)