Programming Homework Help

Randomly populate arrays of size 100 containing integers from 1 to 1000. Send the arrays to the Heap Sort. Use a copy of the Heap Sort class from the source code jar file. Change the Heap Sort class to count the number of upheap swaps (while building) and down heap swaps (while sorting). Print the final number of swaps for each type performed during the Heap sort call.
Try to build the heap with different orders, like sequential order, reverse order, to see the impact of the initial order on the algorithm performance