CS 3100
Fall 2008
MiniProgram 2
Due Monday, November 17, 2008

The purpose of this assignment is to become more familiar with the details of the array-based implementation of the Heap ADT.
Starting on page 620, Carrano provides the code for an array-based implementation of the Heap ADT. The code is provided in the following files: KeyedItem.h, HeapException.h, Heap.h, and Heap.cpp.

Your task is to write a driver that allows the user to build a heap of integer values and delete them in order from highest to lowest. In order to check the state of the heap at any point you should also implement a DisplayHeap function that prints out the keys. You may choose the order and format of the display, however your choices should be well and clearly documented. You are allowed to make changes to the files provided as long as you document those changes.

What To Turn In:

Here is the list of things you have to turn in:
  1. At the start of class on the due date, place the following items on the "counter" in front of me:


  2. Upload to the homework submission system before midnight on the due date: 
Your final source code (driver and all supporting files) and your test script in a tar or shar archive. I will compile and test your programs on the suns in the lab.