selectionSort
number[] [8, 2, 4, 9, 3 ], [8, 2, 4, 3, *9* ], [3, 2, 4, *8*, 9 ], [3, 2, *4*, 8, 9 ], [2, *3*, 4, 8, 9 ]
Selection sort maintains and grows a subset of the largest i items in sorted order
Having already sorted the largest items into sub-array A[i+1: ], the algorithm repeatedly scans the array for the largest item not yet sorted and swaps it with item A[i].
@complexity
O(n^2)
selection sort can require Ω(n^2) comparisons, but will perform at most O(n) swaps in the worst case.
@param[...list]
number[]@returns
number[]