思路:
按找个位十位百位依次进行分类,实际就是按找个位先排序,然后十位…
代码:
package com.wangyq.datastructrue.sort;
import java.util.Arrays;
public class Cardinal {
public static void main(String[] args) {
//定义排序前数组,随机数100个
int[] ints = new int[20];
for (int i = 0; i < 20; i++) {
ints[i] = (int) (Math.random() * 20);
}
//定义一个桶来装排序中的数据
int[][] bucket = new int[10][ints.length];
System.out.println("排序前:" + Arrays.toString(ints));
cardinal(ints, bucket);
System.out.println("排序后:" + Arrays.toString(ints));
}
private static void cardinal(int[] ints, int[][] bucket) {
//循环获取最大数
int temp = ints[0];
for (int i : ints) {
if (i > temp) {
temp = i;
}
}
//获取最大位数
int num = String.valueOf(temp).length();
//记录每一个桶存了几个数
int[] arrs = new int[10];
//记录出桶位置
int index;
int place;
for (int i = 0, remainder = 1; i < num; i++, remainder *= 10) {
//入桶
for (int j : ints) {
//依次取个十百位数字
place = j % (remainder * 10) / remainder;
bucket[place][arrs[place]] = j;
arrs[place] = arrs[place] + 1;
}
//出桶
index = 0;
for (int j = 0; j < 10; j++) {
for (int k = 0; k < arrs[j]; k++) {
ints[index] = bucket[j][k];
index++;
}
//重置记录
arrs[j] = 0;
}
System.out.println("排序中:" + Arrays.toString(ints));
}
}
}
执行结果:
排序前:[4, 11, 0, 8, 3, 13, 9, 11, 17, 19, 2, 1, 13, 9, 10, 5, 18, 15, 11, 10]
排序中:[0, 10, 10, 11, 11, 1, 11, 2, 3, 13, 13, 4, 5, 15, 17, 8, 18, 9, 19, 9]
排序中:[0, 1, 2, 3, 4, 5, 8, 9, 9, 10, 10, 11, 11, 11, 13, 13, 15, 17, 18, 19]
排序后:[0, 1, 2, 3, 4, 5, 8, 9, 9, 10, 10, 11, 11, 11, 13, 13, 15, 17, 18, 19]
桶排序:循环获取最小值最大值,平均分成k个桶,先将各个桶分别排序,然后拼到一起;
计数排序:循环获取最小值最大值,然后定义一个数组,从小开始计数每个值的数量,没有计0,然后通过计数的数组生成排序后的数组