Basic selection sort procedure works as follow:

Even if you have the ith minimum at ith position already, we do a swap, so n-1 swaps for all permutations.