# Now let's use an insertion sort
     # Insert lowest number in the array at the right place in the array
     for i in 0..NUM_STUDENTS - 1
       # Now start at current bottom and move toward arr[i]
       j = i
       done = false
       while ((j > 0) and (! done))
         num_compare = num_compare + 1
         # If the bottom value is lower than values above it, swap it until it lands in a
         # place where it is not lower than the next item above it
         if (arr[j] < arr[j - 1]) 
           temp = arr[j - 1]
           arr[j - 1] = arr[j]
           arr[j] = temp
         else
           done = true
         end
         j = j - 1
       end 
     end