counting_sort

#include<cstdio>
#include<cstring>
using namespace std;

#define size 10000

struct count_sort
{
    int ara[size],counter[size],sorted[size];
    int i,j,k;

    void take_input(int n)
    {
        for(i=0;i<n;i++)
            scanf("%d",ara+i);
        memset(counter,0,sizeof(counter));
    }

    void sorting(int n)
    {
        for(i=0;i<n;i++)
        {
            counter[ara[i]]++;
        }

        for(i=0,k=0;i<size;i++)
        {
            while(counter[i]--)
            {
                sorted[k++]=i;
            }
        }
    }

    void print_out(int n)
    {
        for(i=0;i<n;i++)
            printf("%d ",sorted[i]);
        puts("");
    }

};

int main()
{
    int n;
    count_sort A;

    scanf("%d",&n);
    A.take_input(n);
    A.sorting(n);
    A.print_out(n);

    return 0;
}