Java基数排序代码实现

 public static void radixSort(int []a,int n){
        if (n<=1)return;
        int max = a[0];
        for (int i=0;i0; exp*=10){
            countSort(a,exp);
        }
    }

    private static void countSort(int[] a, int exp) {
        int [] c = new int[10];
        for (int i=0;i=0;i--){
            int index = c[(a[i]/exp)%10]-1;
            r[index] = a[i];
            c[(a[i]/exp)%10]--;
        }

        for (int i=0;i