计数排序——count_sort

void count_sort(int A[],int B[],int k) { int *C = (int *)malloc((k+1) * sizeof(int)); int i,j; for(i=0;i<=k;i++)//初始化数组C C[i]=0; for(j=0;j<=length-1;j++)//计算A中元素的个数 C[A[j]] = C[A[j]]+1; for(i=1;i<=k;i++)//计算小于等于C[i]的元素的个数 C[i] = C[i] + C[i-1]; for(j=length-1;j>=0;j--) { int k=C[A[j]]-1; B[k] = A[j]; C[A[j]] = C[A[j]] - 1; } free(C); }