Java实现基数排序

package com;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
  public static void main(String[] args) {
    Scanner s=new Scanner (System.in);
    int n=s.nextInt();
    int [] a=new int [n];
    for(int i=0;i<n;i++)
      a[i]=(int)(Math.random()*100);
    radixsort(a);
    System.out.println(Arrays.toString(a));
  }
  public static void radixsort (int[] a) {
    int max=a[0];
    for(int i=1;i<a.length;i++) {
      if(a[i]>max)
        max=a[i];
    }
    int maxLength=(max+"").length();
    int [][] bucket=new int [10][a.length];
    int [] bucketCount=new int [10];
    for(int k=0,n=1;k<maxLength;k++,n*=10) {
      for(int i=0;i<a.length;i++) {
        int dight=a[i]/n%10;
        bucket[dight][bucketCount[dight]]=a[i];
        bucketCount[dight]++;
      }
      int index=0;
      for(int i=0;i<10;i++) {
        if(bucketCount[i]!=0) {
          for(int j=0;j<bucketCount[i];j++) {
            a[index]=bucket[i][j];
            index++;
          }
        }
        bucketCount[i]=0;
      }
    }
  } 
}