Radix sort without linklist

#include <stdio.h>
#include <stdlib.h>
int main(void)
{
    int n, i, j, passes, digit, x = 1, k;
    int ar[100];
    printf("enter number of values: ");
    scanf( "%d",&n);
    //printf("enter the numbers: ");
    for(i=0; i<n; i++)ar[i]=rand()%1000; //scanf(" %d",&ar[i]);
    printf("before sort:\n");
    for(i=0; i<n; i++)printf(" %d",ar[i]);
    printf("\n");
    for(passes=1; passes<=3; passes++)
    {
        int table[10][n];
        for(i=0; i<=9; i++)
        {
            for(j=0; j<n; j++)
            {
                table[i][j]=-9999;
            }
        }
        for(i=0; i<n; i++)
        {
            digit=(ar[i]/x)%10;
            table[digit][i]=ar[i];
        }
        k=0;
        for(i=0; i<=9; i++)
        {
            for(j=0; j<n; j++)
            {
                if(table[i][j]!=-9999)
                {
                    ar[k]=table[i][j];
                    k=k+1;
                }
            }
        }
        x*=10;
    }
    printf("after sort:\n");
    for(i=0; i<n; i++)printf(" %d",ar[i]);
    printf("\n");
    return 0;
}