冒泡排序
public class Demo01Sort { public static void main(String[] args) {
int[] arr = {4, 3, 2, 1, 6, 5, 8, 9, 7};
for (int j = 0; j < arr.length - 1; j++) {
for (int i = 0; i < arr.length - 1 - j; i++) {
if (arr[i] > arr[i + 1]) {
int temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
}
for (int i :arr) {
System.out.println(i);
}
}
}
选择排序
public class Demo02Sort {
public static void main(String[] args) {
int[] arr = {4, 3, 2, 1, 6, 5, 8, 9, 7};
for (int i = 0; i < arr.length - 1; i++) {
for (int j = i + 1; j < arr.length; j++) {
if (arr[i] > arr[j]) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
for (int num : arr) {
System.out.print(num + " ");
}
}
}