RADIX SORT ALGORITHM

void radix(int *a,int n,int dig)
{

int aux[10][100],val[100],key[10];
int m,calc,eval,exp,hold;
int i,j,k,z,pass=0;
while(pass!=dig)
{
for(i=0;i<10;i++) key[i]=0;
pass++; m=0;
for(j=0;j {
calc=a[j];
exp=pow(10,pass-1);
k=calc/exp;
k=k%10;
hold=key[k];
key[k]++;
aux[k][hold]=a[j];
}
for(j=0;j<10;j++)
{
eval=key[j];
for(z=0;z {
a[m]=aux[j][z];
m++;
}
}
}
for(i=0;i printf("d\n",a[i]);
}