Radixsort.java

package first;

import java.util.ArrayList;
import java.util.Arrays;
public class Radixsort {
	public static int[] RadixSort(int[] array) {
		if(array==null||array.length<2)
			return array;
			
		int max=array[0];
		for(int i=1;i<array.length;i++) {
			max=Math.max(max, array[i]);
		}
		int maxDigit=0;
		while(max !=0) {
			max/=10;
			maxDigit++;
		}
		int mod=10,div=1;
		ArrayList<ArrayList<Integer>> bucketList=new ArrayList<ArrayList<Integer>>();
		for(int i=0;i<10;i++)
			bucketList.add(new ArrayList<Integer>());
		for(int i=0;i<maxDigit;i++,mod *=10,div *=10) {
			for(int j=0;j<array.length;j++) {
				int num=(array[j]%mod)/div;
				bucketList.get(num).add(array[j]);
			}
			int index=0;
			for(int j=0;j<bucketList.size();j++) {
			for(int k=0;k<bucketList.get(j).size();k++) 
				array[index++]=bucketList.get(j).get(k);
			bucketList.get(j).clear();
			}
		}
		return array;
	}
	public static void main(String[] args) {
		int [] arrays=new int[] {53,56,89,8591,899,5645};
		System.out.println("未进行排序"+Arrays.toString(arrays));
		RadixSort(arrays);
		System.out.println("排序后的数组"+Arrays.toString(arrays));
	}
}