<排序算法> 计数排序CountSort

代码实现：

#include<iostream>
using namespace std;

void PrintArr(int arr[],int len);
void CountSort(int arr[],int len)
{
    if(arr == NULL || len <= 0)    return ;
    
    int min = arr[0];
    int max = arr[0];
    int i;
    for(i=0;i<len;i++)
    {
        if(arr[i] < min)
            min = arr[i];
        if(arr[i] > max)
            max = arr[i];
    }

    int* arrcount = (int*)malloc(sizeof(int)*(max-min+1));
    memset(arrcount,0,sizeof(int)*(max-min+1));
    for(i=0;i<len;i++)
    {
        arrcount[arr[i]-min] ++;
    }

    int j=0;
    for(i=0;i<max-min+1;i++)
    {
        if(arrcount[i] != 0)
            while(arrcount[i]--)
                arr[j++] = i + min;
    }

    return ;
}

void PrintArr(int arr[],int len)
{
    for(int i=0;i<len;i++)
        cout << arr[i] << " ";
    cout << endl;

    return ;
}

int main()
{
    //int arr[10] = {9,8,7,6,5,4,3,2,1,0};
    //int arr[10] = {4,8,6,3,7,2,9,5,0,1};
    int arr[10] = {4,4,2,3,3,8,8,8,5,5};
    CountSort(arr,sizeof(arr)/sizeof(arr[0]));
    PrintArr(arr,sizeof(arr)/sizeof(arr[0]));

    system("pause");
    return 0;
}