Given an array of integers, sort it in non-decreasing order using **Selection Sort** — repeatedly find the smallest value among what's left to place, and put it into its correct position. Unlike bubble sort or insertion sort, selection sort makes at most one swap per pass — it spends its time searching for the minimum rather than moving values around during the search. That makes the number of writes to the array very predictable (exactly n-1 swaps total), even though the number of comparisons is the same O(n²) as the other simple sorts.