In the {best|average|worst} case, the total number of swaps done by Selection Sort is closest to:

n
  • n^2/2
  • n^2
  • n \log n

Does Selection Sort's number of swaps depend on the particular order of the input array?

No, it does not.

Recall that our implementation for Selection Sort will try to swap even if the current record is in its correct location.