Re:Is this the simplest sorting algorithm?
by cato_the_elder on Sunday May 08, 2022 @01:27AM
(#31301594)
I think it's more similar to insertion sort. In the first iteration of the outer loop, it moves the maximum to A[1]. After that, it works essentially like insertion sort, except that it does a bunch of unnecessary comparisons after finding the location to insert the element, and does the shifting in a slightly weird way.
[ Parent
| on HN ]
There are no comments on this comment yet.