counting sort(stable)
#include<stdio.h>#include<malloc.h>
void counting_sort(int a[], int sorted[],int k,int size)
{
int *c=(int *)malloc((k+1)*sizeof(int));
int i=0;
for(;i<k+1;i++)
c=0;
for(i=0;i<size;i++)
c]=c]+1;
//now,c contains the numbers of elements equals to i
for(i=1;i<k+1;i++)
c=c+c;
//now ,c contains the numbers of elements equals or less than i
for(i=size-1;i>-1;i--)
{
sorted]-1]=a;
c]=c]-1;
}
free(c);
}
int main()
{
int a={9,5,2,6,7,1,0,3,8,4};
int b={-1};
counting_sort(a,b,9,10);
int i=0;
for(;i<10;i++)
printf("%d ",b);
printf("\n");
return 0;
}
页:
[1]