/******************************************************************

   Class Radix sorts integers greater than 0 and smaller than 100. 

   This is the fastest sorting algorithm for numbers of this kind.



   Authors  : Bent Kristiansen, Roy Mitchley, Per Edvard Heyerdahl        Norway  

   Finished : 28.03.97

*******************************************************************/



import java.*;



class Radix

{

   public void distribute(int[] L, Queue[] digitQueue,int n,int type) // distributes the numbers in L

   {                                                                  // to the correct digitQueue of 

      for(int i=0; i<n; i++)                                          // the type

         if(type == 1)

            digitQueue[L[i]%10].set(L[i]);

         else

            digitQueue[L[i]/10].set(L[i]);   

   }

      

   public void collect(Queue[] digitQueue,int[] L)                    // collects the numbers in the

   {                                                                  // digitQueue and put them in

      int i=0;                                                        // a certian order back in L

      

      for(int digit=0; digit<10; digit++)

         while(!digitQueue[digit].empty())

            L[i++] = digitQueue[digit].get();

   }

   

   public void print(int[] L, int n)                                  // prints out L

   {

      int i=0;

      

      while(i<n)

      {

         System.out.print("   ");

         System.out.print(L[i]);

         

         if((i+1)%10 == 0)

            System.out.println();

          

         i++;   

      }

      

      System.out.println();

   }

   

   public static void main(String args[])

   {

      RadixSort sort = new RadixSort();

      Queue[] digitQueue = new Queue[10];

      RandomIntGenerator random = new RandomIntGenerator(0,99);

      int size = 20;                                                  // the size of L 

                                                                      // (how many numbers will we sort)

      for(int i=0; i<10; i++)

         digitQueue[i] = new Queue();                                 // creates the digitQueues

         

      int[] L = new int[size];                                        // creates L

      

      for(int i=0; i<size; i++)                                       // fills L with random numbers

         L[i] = random.draw();

                 

      sort.print(L,size);                                             // prints the original L

      

      sort.distribute(L,digitQueue,size,1);

      sort.collect(digitQueue,L);

      sort.print(L,size);                                             // prints first step of the sort

      

      sort.distribute(L,digitQueue,size,10);

      sort.collect(digitQueue,L);

      sort.print(L,size);                                             // prints sorted numbers

   }

}