算法4笔记/排序算法

排序类算法模板

public static void sort(Comparable[] a) {
    //排序内容
}

private static boolean less(Comparable v, Comparable w) {
    //比较两数大小，若v小于w，则返回true
    return v.compareTo(w) < 0;
}

private static void exch(Comparable[] a, int i, int j) {
    //交换两元素位置
    Comparable t = a[i];
    a[i] = a[j];
    a[j] = t;
}

private static void show(Comparable[] a) {
    // 在单行中打印数组
    for (int i = 0; i < a.length; i++)
        StdOut.print(a[i] + " ");
    StdOut.println();
}

public static boolean isSorted(Comparable[] a) {
    //测试数组元素是否有序
    for (int i = 1; i < a.length; i++) {
        if (less(a[i], a[i - 1]))
            return false;
    }
    return true;
}