选择排序

选择排序

public class Selection {
    public static void sort(Comparable[] a) {
        int length = a.length;

        // 每一次循环都将最小的元素选择出来放到数组的最前，所以是叫 选择排序
        // 每一次循环都会有一次交换
        // 每次循环都有 N-1-i 次比较
        // 总计 N 此交换
        // (N-1) + (N-2) + ... + 2 + 1 = N(N-1)/2 ~ N²/2 次比较
        for (int i = 0; i < length; i++) {
            int min = i;
            for (int j = i + 1; j < length; j++) {
                if (less(a[j], a[min])) {
                    min = j;
                }
            }

            exchange(a, i, min);

        }
    }

    public static boolean isSorted(Comparable[] a) {

        for (int i = 1; i < a.length; i++) {
            if (less(a[i], a[i - 1])) {
                return false;
            }
        }

        return false;
    }

    public static boolean less(Comparable a, Comparable b) {
        return a.compareTo(b) < 0;
    }

    public static void exchange(Comparable[] a, int i, int j) {
        Comparable temp = a[i];

        a[i] = a[j];

        a[j] = temp;
    }

    public static void show(Comparable[] a) {
        for (int i = 0; i < a.length; i++) {
            System.out.print(a[i] + " ");
        }

        System.out.println();
    }
}