排序-选择-java

public class Test {
    public static void main(String[] args) {
        int[] arr = {5, 2, 6, 8, 9, 1};
        if (arr == null || arr.length <= 2) {
            return;
        }
        for (int i = 0; i < arr.length - 1; i++) {
            //选择排序：主要是选择一个数，然后在整个数组里遍历取最大/最小，遍历完一轮就交换index，依此类推
            int index = i;
            for (int j = i + 1; j < arr.length; j++) {
                index = arr[j] > arr[index] ? j : index;
            }
            swap(arr, i, index);
        }
        for (int i = 0; i < arr.length; i++) {
            System.out.println(arr[i]);
        }
    }

    private static void swap(int[] arr, int i, int j) {
        int temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
    }
}