计数排序（Counting-Sort）

计数排序（Counting-Sort）

import java.util.Arrays;

/**
* Created by CvShrimp on 2017/11/11.
*/
public class CountingSort {
public static int[] countingSort(int[] array, int k) {
//k表示待排序数组的最大的元素值
int[] c = new int[k + 1];
for(int j = 0; j < array.length; j++) {
//c[i]记录原数组中等于i的元素的个数
c[array[j]] = c[array[j]] + 1;
}

for(int i = 1; i <= k; i++) {
//c[i]记录原数组中小于等于i的元素个数
c[i] = c[i] + c[i - 1];
}
int[] b = new int[array.length];
for(int j = array.length - 1; j >= 0; j--) {
b[c[array[j]] - 1] = array[j];
c[array[j]] = c[array[j]] - 1;
}
return b;
}

public static void main(String[] args) {
int[] array = {6,5,6,66,1,10,33};
int[] sortedArray = CountingSort.countingSort(array, 66);
System.out.println(Arrays.toString(sortedArray));
}
}

[1, 5, 6, 6, 10, 33, 66]

Process finished with exit code 0