Homework #4


Implement heap sort by using the bottom-up insertion 
method. Add this sort to your sorting framework. Evaluate
its performance in terms of the numbers of comparisons and
exchanges, and compare it to the performance of the two
advanced sorting methods that you have previously implemented.
Submit your report with detailed empirical results and a
thorough explanation of these results. Which of the three
advanced sorting method is the best choice for a) ordered
data, b) reverse data, and c) average data for the data sets
you have experimented with.