问使用已排序数组进行选择排序需要交换多少次？

EN

swapping = swap(a, i, min, this.swaps);

public class SelectionSort implements ISorter {
      private int swaps;
      public SelectionSort(){
      }

      @Override
      public ISortStats sort(int[] a) {
            long time = System.nanoTime();
            int swapping =0;
            int numOfComparisons = 0;
            for (int i=0; i<a.length; i++) {
                  int min = i;      

                  for (int j=i+1; j < a.length; j++) {
                        numOfComparisons++;
                        if (a[min] >= a[j]) {
                              min = j;  

                        }

                  }

                  swapping = swap(a, i, min, swapping);

            }

            long endTime = System.nanoTime();
            SortStats ss = new SortStats("Selection Sort", a.length, numOfComparisons, swapping, (endTime -time));
            return ss ;
      }           

      private static int swap (int[] a, int i, int j, int swapping){
            if(!(order(a))){
                  swapping++;
                  int temp = a[i];
                  a[i] = a[j];
                  a[j] = temp;
            }
            return swapping;
      }
      private static boolean order(int[] arr){
            int count = 0; 
            //this loop runs thru the array to check if it is in order.
            for(int a = 0; a < arr.length-1; a++){
                  if(arr[a] <= arr[a+1]){ // if true count plus 1
                        count++; 
                  }
            }
            if(count == arr.length-1){ // checks if the count and arr length -1 is equal 
                  return true; // if equal it will return true
            }
            return false; // returns false if the array is not correctly sorted.
      }


}