// 优化冒泡排序法
int [] arr = {3, 2, 1, 5, 4, 9, 7, 8, 6};
boolean flag = false;
for (int i = 0; !flag && i < arr.length - 1; i++) {
flag = true;
for (int j = 0; j < arr.length - 1 - i; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
flag = false;
}
}
}
System.out.println(Arrays.toString(arr));
// 选择排序法
int [] arr = {3, 1, 5, 4, 2, 9, 7, 8, 6};
for (int i = 0; i < arr.length - 1; i++) {
int minIndex = i;
for (int j = minIndex + 1; j < arr.length; j++) {
if (arr[minIndex] > arr[j]) {
minIndex = j;
}
}
if (minIndex != i) {
int temp = arr[minIndex];
arr[minIndex] = arr[i];
arr[i] = temp;
}
}
System.out.println(Arrays.toString(arr));