Due: Friday 19 November
Big Picture: Using the heap implementation from last week, we're going to build a generic Heap implementation similar to the generic Priority Queue implementation from way back when, and test it on a simple application--reading and sorting a grade sheet.
Before you begin, you should have a working implementation of the Heap class, along with a main method that tests it by inserting 100 randomly-generated integers into the Heap and the removing them. They should be in order. I recommend that you print the Heap when it is full so you can confirm that it is a complete tree.