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 ano
| This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||||||||||||||
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)
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)
The article gives no insight whatsoever to how the algorithm works or why it's slow. The list of steps ("sort the first half" etc) is more confusing than helpful. There should be at least a paragraph giving an overview. ~2026-41916-61 (talk) 13:32, 29 July 2026 (UTC)
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.