public class CountSort {
public static void main(String[] args) {
int[] arr = {7,3,2,8,1,9,8,6,5,3,2,8,9,4,1,7,5,4,6,0,10,0,7,3,1,10,10,10};
count(arr);
}
static void count(int[] arr) {
int[] arrCount = new int[11];
for (int i = 0; i < arr.length; i++) {
arrCount[arr[i]]++;
}
int[] arrNew = new int[arr.length];
int k = 0;
for (int i = 0; i < arrCount.length; i++) {
for (int j = 0; j < arrCount[i]; j++) {
arrNew[k] = i;
/*print(arrNew);
System.out.println();*/
k++;
}
}
print(arrCount);
System.out.println();
print(arrNew);
}
static void print(int[] arr) {
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
}
}
记数排序 CountSort
最新推荐文章于 2024-08-07 21:27:48 发布