Assignment for Tuesday, November 14^th.

1. Step 1 – download the build heap files (either word or html) from https://users.cs.jmu.edu/adamses/public

2. Step 2 – download the heap sort file (either word or html) from

https://users.cs.jmu.edu/adamses/public --

3. Print the heap sort file and write your name on the top of the page(s). Follow the directions at the top of the page.

4. Using the files you have downloaded as a guide to the algorithms necessary, write Ada code to

a. build a heap

b. sort the heap

5. Turn in the print out of the heap sort file with the trees you have drawn in to the TA (Christine Jones).

6. Submit the code you have written by the end of the period to the drop box as yournameX where X represents the next number. If you finish both the build heap and the heap sort, you can submit them zipped together. If you finish only one of them, do NOT zip it.

7. You need to finish the code by class time on Thursday.