桶排序

剑指offer 2.4.1

#include <stdio.h>
#include <stdlib.h>

void sortAges(int a[],int n)
{
    const int MAXAGE=99;
    if(a==NULL||n<=0)
        return;
    int ageTimes[MAXAGE+1];
    int i,j,age,counts;
    for(i=0; i<=MAXAGE; ++i)
        ageTimes[i]=0;
    //读入年龄放入数组中
    for(i=0; i<n; ++i)
    {
        age=a[i];
        ageTimes[age]++;
    }
    //把排完序的结果写入数组中
    int k=0;
    for(i=0; i<=MAXAGE; ++i)
    {
        counts=ageTimes[i];
        for(j=0; j<counts; ++j)
        {
            a[k]=i;
            k++;
        }

    }

}

int main()
{
    int a[]= {10,10,3,4,5,6,6,72,2,4,43,2,2,1};
    int n=sizeof(a)/sizeof(int);
    int i;
    sortAges(a,n);
    for(i=0; i<n; ++i)
        printf("%d
",a[i]);
    return 0;
}