Run the heapsort algorithm on the following array, showing the exact
configuration of the array at each step.

   A S I V B T Y

Answer: we first heapify.

   A S I V B T Y
   A S Y V B T I
   A V Y S B T I
   Y V A S B T I
   Y V T S B A I

We now execute deletemax repeatedly.

   Y V T S B A I
   I V T S B A|Y
   V S T I B A|Y
   A S T I B|V Y
   T S A I B|V Y
   B S A I|T V Y
   S B A I|T V Y
   S I A B|T V Y
   B I A|B T V Y
   I B A|B T V Y
   A B|I B T V Y
   B A|I B T V Y
   A|B I B T V Y
   A B I B T V Y