java常见排序算法——选择排序（附代码示列）

public void selectSort(int[] nums){
  for (int i = 0; i < nums.length-1; i++) {
      int index = i;
      int minNum = nums[i];
      for (int j = i+1; j < nums.length; j++) {
          if(nums[j] < minNum){
              minNum = nums[j];
              index = j;
          }
      }
      if(index != i){
          nums[index] = nums[i];
          nums[i] = minNum;
      }
  }

}

PS：每次选出最值，再交换到边上。