基数排序完整代码:
**
* @Title: radixSort
* @Description: 桶排序
* @param nums 待排序数组
*/
public static void radixSort(int nums[]) {
int max = nums[0];
for (int i = 0; i < nums.length; i++) {
if (nums[i] > max) {
max = nums[i];
}
}
int maxLength = (max + "").length();
int[][] bucket = new int[10][nums.length];
int[] bucketElementsCounts = new int[10];
for (int i = 0, n = 1; i < maxLength; i++, n *= 10) {
for (int j = 0; j < nums.length; j++) {
int digitOfElement = nums[j] / n % 10;
bucket[digitOfElement][bucketElementsCounts[digitOfElement]] = nums[j];
bucketElementsCounts[digitOfElement]++;
}
int index = 0;
for (int k = 0; k < bucketElementsCounts.length; k++) {
if (bucketElementsCounts[k] != 0) {
for (int l = 0; l < bucketElementsCounts[k]; l++) {
nums[index++] = bucket[k][l];
}
}
bucketElementsCounts[k] = 0;
}
}
}