INSERT in the order 4, 1, 3, 2, 16, 9, 10, 14, 8, 7
  insert 4	-> [4]
  insert 1	-> [4 1]
  insert 3	-> [4 1 3]
  insert 2	-> [4 2 3 1]
  insert 16	-> [16 4 3 1 2]
  insert 9	-> [16 4 9 1 2 3]
  insert 10	-> [16 4 10 1 2 3 9]
  insert 14	-> [16 14 10 4 2 3 9 1]
  insert 8	-> [16 14 10 8 2 3 9 1 4]
  insert 7	-> [16 14 10 8 7 3 9 1 4 2]

MAXIMUM = 16  (one array read, no comparisons)

INSERT(15) into the heap above
  -> [16 15 10 8 14 3 9 1 4 2 7]

EXTRACT-MAX three times
  extracted 16	-> [15 14 10 8 7 3 9 1 4 2]
  extracted 15	-> [14 8 10 4 7 3 9 1 2]
  extracted 14	-> [10 8 9 4 7 3 2 1]

INCREASE-KEY(A, 8, 20): raise the key at position 8 to 20
      parent A[4]=4 < A[8]=20, so swap them
      parent A[2]=8 < A[4]=20, so swap them
      parent A[1]=10 < A[2]=20, so swap them
      the key has stopped at position 1
  -> [20 10 9 8 7 3 2 4]

Drain the queue: 20 10 9 8 7 4 3 2
