排序算法之二选择排序-简单选择排序和对堆排序

1234567891011121314151617181920212223242526272829303132

/**     * 简单选择排序     */    private static <AnyType extends Comparable<? super AnyType>> void selectedSort(AnyType[] arr) {        System.out.println("原数组为: " + Arrays.toString(arr));        boolean exchange = true;        for (int i = 0; i < arr.length && exchange; ++i) {            exchange = false;            AnyType min = arr[i];   // 把当前值放在一个临时变量里面，后面的数只要比它小就替换            int minIndex = i;   // 当前最小数的索引值            for (int j = i+1; j < arr.length; ++j) {                if (arr[j].compareTo(min) < 0) {                    exchange = true;                    min = arr[j];                    minIndex = j;                }            }            if (!exchange) {                break;            }            arr[minIndex] = arr[i];            arr[i] = min;            System.out.println(Arrays.toString(arr));        }        /**         原数组为: [23, 1, 42, 5, 2, 23, 12]         [1, 23, 42, 5, 2, 23, 12]         [1, 2, 42, 5, 23, 23, 12]         [1, 2, 5, 42, 23, 23, 12]         [1, 2, 5, 12, 23, 23, 42]         */    }