java常见排序算法——冒泡排序

public void bubbleSort(int[] nums){
  int temp;
  boolean isSort = false; 
  for (int i = 0; i < nums.length-1; i++) {
    for (int j = 0; j < nums.length-1-i; j++) { if(nums[j] > nums[j+1]){
        isSort = true;
        temp = nums[j];
        nums[j] = nums[j+1];
        nums[j+1] = temp;
      }
    }
    if(!isSort){
      return;
    } else {
      isSort = false;
    }
  }

}

PS：每轮循环确定最值。