DAA Counting sort

#include <stdio.h>
int main(void) {    //stable algo-- sequence remains unchanged--their occurence is maintained--Eg medicine

    int a[]={3,4,2,0,3,0,2,3,5,4};
    int k=6; //one increment for algorithm size
    int i,j,p;
    int c[k],b[11];

    for(i=0;i<k;i++){
    c[i]=0;
    printf("%d ",c[i]);
    }

    printf("\n");

    for(j=0;j<10;j++){
    c[a[j]]=c[a[j]]+1; //c[3]=c[3]+1
    }
    printf("\n");

    for(j=0;j<k;j++){
    printf("%d ",c[j]);
    }

    printf("\n");

    for(i=1;i<k;i++)
     {

    c[i]=c[i]+c[i-1];

    }

    for(j=0;j<k;j++){
    printf("%d ",c[j]);
    }


for(i=9;i>=0;i--)
        {
            b[c[a[i]]]=a[i];
            c[a[i]]=c[a[i]]-1;

        }
        printf("\n");
    for(i=1;i<11;i++)
        {
            printf("%d  " ,b[i]);

        }



}