1、升序选择排序
代码:
public class Test {
public static void main(String[] args) {
int[] a = {3, 2, 1, 0};
for (int i = 0; i < a.length - 1; i++) {
int min = i;
for (int j = i + 1; j < a.length; j++) {
if (a[min] > a[j]) {
min = j;
}
}
if (min != i) {
int b = a[i];
a[i] = a[min];
a[min] = b;
}
}
for (int c : a) {
System.out.println(c);
}
}
}
结果:
0
1
2
3
2、降序选择排序
代码:
public class Test {
public static void main(String[] args) {
int[] a = {0, 1, 2, 3};
for (int i = 0; i < a.length - 1; i++) {
int max = i;
for (int j = i + 1; j < a.length; j++) {
if (a[max] < a[j]) {
max = j;
}
}
if (max != i) {
int b = a[i];
a[i] = a[max];
a[max] = b;
}
}
for (int c : a) {
System.out.println(c);
}
}
}
结果:
3
2
1
0