A sorting algorithm which makes 
passes over a set of 
elements, in each pass selecting the smallest element and
deleting it from the set. This algorithm has running time 
, compared to 
for the best algorithms (Skiena 1990, p. 14).
Selection Sort
See also
SortingExplore with Wolfram|Alpha
References
Knuth, D. E. "Sorting by Selection." §5.2.3 in The Art of Computer Programming, Vol. 3: Sorting and Searching, 2nd ed. Reading, MA: Addison-Wesley, pp. 138-144, 1998.Skiena, S. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, 1990.Referenced on Wolfram|Alpha
Selection SortCite this as:
Weisstein, Eric W. "Selection Sort." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/SelectionSort.html