Talk:Slowsort

Difference from selection sort

From the article: "It finds the maximum of the sorted array, places that maximum at the end and sorts the remaining array recursively." How is that not just another name for selection sort? --Damian Yerrick (talk) 02:54, 29 January 2019 (UTC)

You are right, that sentence is misleading as it fails to mention the deliberately pessimal way the maximum is determined (and this is what distinguishes slow sort from selection sort). I have removed that sentence. (I think the remaining text of the Algorithm section is an adequate description of the algorithm. Do you agree?) – Tea2min (talk) 12:50, 29 January 2019 (UTC)

"Slow+sort" listed at Redirects for discussion

The redirect Slow+sort has been listed at redirects for discussion to determine whether its use and function meets the redirect guidelines. Readers of this page are welcome to comment on this redirect at Wikipedia:Redirects for discussion/Log/2025 November 6 § Slow+sort until a consensus is reached. Steel1943 (talk) 20:23, 6 November 2025 (UTC)