排序过程如下图:
int[] arr = { 63, 4, 24, 1, 3, 13 };
for (int i = 1; i < arr.length; i++) {// 轮数
for (int j = 0; j < arr.length - i; j++) {
System.out.println("i==" + i + ",j===" + j);
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];// 交换位置
arr[j + 1] = temp;
}
}
}
for (int j = arr.length; j < arr.length; j++) {
int temp = arr[j];
System.out.println("paixu==" + temp);
}