排序算法类的模板

public class Example {
    //数组排序算法
    public static void sort(Comparable[] a){

    }

    private static boolean less(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.println(a[i] + " ");
        }
    }
    //判断数组元素是否有序
    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[] agrs)
    {
        String[] a = {"1","2","3","4","5"};
        sort(a);
        assert isSorted(a);
        show(a);
    }
}