Radix Sort Program

Radix Sort Program:

class Radix_Sort
{
       static int store[] = {213,310,122,457,564,986,455,789,143,191};
       static int ar[] = {213,310,122,457,564,986,455,789,143,191};
       public static void main ( String args[] )
       {
              int n = 3, m = 1;
              while(n != 0)
              {
                     int d[] = new int[ar.length];
                     m = m*10;
                     for(int x=0; x<=ar.length-1; x++)
                     {
                            d[x] = ar[x]%m;
                            if(d[x] >= 10 && d[x] <= 99)
                            {
                                   d[x] = d[x]/10;
                            }
                            else if(d[x] >= 100 && d[x] <= 999)
                            {
                                   d[x] = d[x]/100;
                            }
                     }
                     insertion_sort (d, ar, store);
                     n--;
              }
              for(int x=0; x<=ar.length-1; x++)
              {
                     System.out.print(store[x] + " ");
              }
       }

       public static void insertion_sort (int d[], int ar[], int store[] )
       {
              for(int x=1; x<=ar.length-1; x++)
              {
                     int i = x-1;
                     int temp1 = d[x];
                     int temp2 = ar[x];
                     int temp3 = store[x];
                     while(i >=0 && d[i] > temp1)
                     {
                            d[i+1] = d[i];
                            ar[i+1] = ar[i];
                            store[i+1] = store[i];
                            i = i-1;
                     }
                     d[i+1] = temp1;
                     ar[i+1] = temp2;
                     store[i+1] = temp3;
              }
       }
}