package RedixSort;import java.util.Arrays;publicclassredixSort{publicstaticvoidmain(String[] args){// TODO 自动生成的方法存根int arr[]={-4,53,3,542,-6,748,14,214};for(int i=0;i<arr.length;i++){
arr[i]=arr[i]+6;}RedixSort(arr);for(int i=0;i<arr.length;i++){
arr[i]=arr[i]-300;}
System.out.println(Arrays.toString(arr));// System.out.println((arr[0]+"").length());}publicstaticvoidRedixSort(int[] arr){int[][] bucket =newint[10][arr.length];int[] element =newint[10];int max = arr[0];for(int i =0; i < arr.length; i++){if(arr[i]> max){
max = arr[i];}}int maxlength =(max +"").length();for(int i =1, n =1; i <= maxlength; i++, n *=10){for(int j =0; j < arr.length; j++){int a = arr[j]/ n %10;
bucket[a][element[a]]= arr[j];
element[a]++;}int index =0;for(int k =0; k < element.length; k++){if(element[k]!=0){for(int l =0; l < element[k]; l++){
arr[index]= bucket[k][l];
index++;}}
element[k]=0;}}}}