Content deleted Content added
RGCanimation (talk | contribs) |
Changed an "an" to an "a" due to the fact that when reading an O(n^2) doesnt make sense as it should be read an Big O of (n^2) so should be a not an |
||
Line 13:
}}
In [[computer science]], '''selection sort''' is an [[in-place algorithm|in-place]] [[comparison sort|comparison]] [[sorting algorithm]]. It has
The algorithm divides the input list into two parts: a sorted sublist of items which is built up from left to right at the front (left) of the list and a sublist of the remaining unsorted items that occupy the rest of the list. Initially, the sorted sublist is empty and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right.
| |||