计数排序思想
1.定义一个数组长度为10,存放产生的随机数
2.定义一个计数数组,存放相同的数字在同一个计数数组的下标中
3.定义一个新数组,存放排序后的数字
import java.util.Arrays;
public class countSort {
public static void main(String[] args) {
int[] nums = new int[10];
for (int i = 0; i < nums.length; i++) {
nums[i] = (int) (Math.random() * 9 + 1);
}
System.out.println(Arrays.toString(nums));
int[] count = new int[10];
for (int i = 0; i < count.length; i++) {
count[nums[i] - 1]++;
}
System.out.println(Arrays.toString(count));
int[] newNums = new int[10];
int index = 0;
for (int i = 0; i < count.length; i++) {
for (int j = 0; j < count[i]; j++) {
newNums[index] = i + 1;
index++;
}
}
System.out.println(Arrays.toString(newNums));
}
}