计数排序的思想就是对每一个输入的元素x,确定出小于x的个数,直接把x放入最终输出数组的位置上。
#include <stdio.h>
#include <stdlib.h>
#define MAX_INT 65535
#define NUM 16
void printArray(int array[], int length);
void countingSort(int array[],int length,int maxValue);
int main()
{
int array[NUM] = {23,12,3,4,2,3,234,5655,34,123,445,44,3,4,56,78};
int i ;
countingSort(array,NUM,MAX_INT);
printArray(array,NUM);
return 0;
}
void countingSort(int array[],int length,int maxValue)
{
int result[length];
int counting[maxValue];
int i = 0;
for(i = 0;i < maxValue; ++i)
{
counting[i] = 0;
}
for(i = 0; i < length; ++i)
{
++counting[array[i]];
}
for(i = 1; i < maxValue; ++i)
{
counting[i] += counting[i - 1];
}
for(i = 0;i < length; ++i)
{
result[counting[array[i]]] = array[i];
--counting[array[i]];
}
for(i = 0; i < length;++i)
{
array[i] = result[i + 1];
}
}