Talk:Slowsort

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

Difference from selection sort[edit]

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)[reply]

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)[reply]