算法排序☞基数排序
public static void radixSort(int[]arr) { int [][]bucket = new int[10][arr.length];//map 存放 int []bucketCounts = new int[10]; int max = 0; for (int i = 0; i < arr.length; i++) { if(arr[i]>max) { max = arr[i]; } } String str = max+""; for (int m = 0,n=1; m < str.length(); m++,n*=10) { for (int i = 0; i < arr.length; i++) { int ge = arr[i]/n%10; bucket[ge][bucketCounts[ge]]= arr[i]; bucketCounts[ge]++; } int index =0 ; for (int i = 0; i < bucketCounts.length; i++) { if(bucketCounts[i]!=0) { for (int j = 0; j < bucketCounts[i]; j++) { arr[index++] = bucket[i][j]; } } bucketCounts[i]=0; } } } }