selection sort

RU: сортировка выбором

An in-place sorting algorithm that repeatedly finds the minimum element in the unsorted portion of the array and swaps it into its final position. Time is O(n²) in all cases — best, average, and worst — because the inner scan always covers the full unsorted region. It makes O(n) swaps, fewer than bubble sort, but is not stable in its standard form.