啊哈添柴——挑战
1663. 选择排序(高级版)
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int mode = scanner.nextInt();
int arr[] = new int[n];
for (int i = 0; i < arr.length; i++) {
arr[i] = scanner.nextInt();
}
selectSortUpOrDown(arr, mode);
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i]+" ");
}
}
public static void selectSortUpOrDown(int arr[],int mode) {
for (int i = 0; i < arr.length - 1; i++) {
int index = i;
for (int j = i + 1; j < arr.length; j++) {
if (mode==1) {
if (arr[j] < arr[index]) {
index = j;
}
} else {
if (arr[j] > arr[index]) {
index = j;
}
}
}
if (i != index) {
int temp = arr[i];
arr[i] = arr[index];
arr[index] = temp;
}
}
}
}