计数排序

void counting_sort(int *ini_arr, int *sorted_arr,int n,int l)
{
int *count_arr = (int *)malloc(sizeof(int) * l);
int i, j, k;
for(k=0; k<l; k++)
count_arr[k] = 0;

for(i=0; i<n; i++)
count_arr[ini_arr[i]]++;

for(k=1; k<l; k++)
count_arr[k] += count_arr[k-1];

for(j=n; j>0; j--)
{
sorted_arr[count_arr[ini_arr[j-1]]-1] = ini_arr[j-1];
count_arr[ini_arr[j-1]]--;
}

free(count_arr);
}