计数排序

void CountSort(int* INarry,int maxValue,int size,int *OUTarry)
{
int i=0,k=0;
int* count=new int[maxValue];
for(i=0;i<maxValue;i++)
count[i]=0;
for(i=0;i<size;i++)
{
count[INarry[i]-1]++;
}
for(i=1;i<maxValue;i++)
count[i]=count[i]+count[i-1];
for(i=0;i<size;i++)
{
k=count[INarry[i]-1]--;
OUTarry[k-1]=INarry[i];
}
delete count;
cout<<OUTarry[0]<<OUTarry[1]<<OUTarry[2]<<OUTarry[3];

}

 

int _tmain(int argc, _TCHAR* argv[])
{
int a[]={7,6,6,1};
int *temp=new int[4];


CountSort(a,7,4,temp);
system("pause");
return 0;
}