经典冒泡排序和选择排序

int [] arr =new int[]{9,2,1,11,6,4,3};int index = 0 ; //记录排序的次数//冒泡排序for (int i = 0; i < arr.length-1; i++) {for (int j =0 ; j < arr.length-1-i; j++) {if(arr[j]>arr[j+1]){int b = arr[j];arr[j] = arr[j+1];arr[j+1] =b;}index++;}}System.out.println("排序后--------");for (int i = 0; i < arr.length; i++) {System.out.println(arr[i]);}System.out.println("排序次数 :" + index);

结果：

选择排序：

int [] arr =new int[]{9,2,1,11,6,4,3};int index = 0 ; //记录排序的次数//选择排序for (int i = 0; i < arr.length-1; i++) {for (int j = i+1; j < arr.length; j++) {if(arr[i]>arr[j]){int b = arr[i];arr[i] = arr[j];arr[j] =b;}index++;}}System.out.println("排序后--------");for (int i = 0; i < arr.length; i++) {System.out.println(arr[i]);}System.out.println("排序次数 :" + index);

结果：

已上传结果可见：冒泡和选择的排序次数是一致的。