1: public static void insertionsort(Elem[] array) {
   2:     int i, j;
   3:     Elem curr;
   4:     
   5:     for (i=1; i < array.length; i++) {
   6:         curr = array[i];
   7:         for (j=i-1; j >= 0 && array[j].key() > curr.key(); j--)
   8:             array[j+1] = array[j];
   9:         array[j+1] = curr;
  10:     }
  11: }
  12: