排序算法类的模板

import java.util.Scanner;

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.print(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[] args) {
        // TODO Auto-generated method stub
        //从标准输入读取字符串，将它们排序并输出
        Scanner scan = new Scanner(System.in);
        String str = scan.nextLine();
        Comparable[] a = new Comparable[str.length()];

        for(int i=0; i<str.length(); i++){
            a[i] = str.charAt(i);
        }
        sort(a);
        assert isSorted(a);
        show(a);
    }
}