Selection sort builds the sorted part one position at a time by picking the minimum of what is left. It makes at most n - 1 swaps, which matters only when a swap is expensive. Learn it because tests ask you to trace passes and compare it with bubble and insertion sort. It always takes O(n²) comparisons, even on sorted input, so it is not used for real data.