选择排序，每次找出数组中最小值，放到有序元素后面

public class SelectionSort {
    public static void main(String[] args) {
        //手写选择排序
        ThreadLocalRandom rd = ThreadLocalRandom.current();
        int[] arr = new int[10];
        for (int i = 0; i < arr.length; i++) {
            arr[i] = rd.nextInt(1000) + 1;
        }
        System.out.println("排序前：");
        System.out.println(Arrays.toString(arr));
        for (int i = 0; i < arr.length - 1; i++) {
            int min = i;
            for (int j = i + 1; j < arr.length; j++) {
                if (arr[min] > arr[j]) {
                    min = j;
                }
            }
            int tmp = arr[i];
            arr[i] = arr[min];
            arr[min] = tmp;
        }
        System.out.println("排序后：");
        System.out.println(Arrays.toString(arr));
    }
}