Time the results of heapsort and merge sort. Which algorithm behaves better in practice?

Complete the following file:

SorterTimer.java