In selection sort the number of swaps is always O(n).
Why? We find minimum element in unsorted part of array and swap it with first element of unsorted part of array. So for each phase only 1 swap is there.
In Insertion Sort in worst case number of swaps is O($n^2$). For merge sort no of swap is $O(N^2)$