1: public static void binsort(Elem array[], int MaxValue) {
   2:     int i;
   3:     int insertindex;
   4:     LList C[] = new LList[MaxValue + 1];
   5:     
   6:     for (i=0; i <= MaxValue; i++)
   7:         C[i] = new LList();
   8:     
   9:     for (i=0; i<array.length; i++) 
  10:         C[array[i].key()].append(array[i]);
  11: 
  12:     insertindex = 0;
  13:     for (i=0; i < MaxValue; i++)
  14:         for (C[i].setFirst(); C[i].isCurrentValid(); C[i].next()) {
  15:             array[insertindex] = (Elem) C[i].currentValue();
  16:             insertindex++;
  17:         }
  18: }
  19: