插入排序

排序算法类的模板

public class Example {
    public static void sort(Comparable[] a){
        //排序
    }
    private static boolean less(Comparable<Comparable> v,Comparable w){
        //比较
        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++)
            System.out.print(a[i]+" ");
        System.out.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;
    }
    public static void main(String[] args){
        //测试排序方法以及性能
    }
}