So.  This is what the results look like:

Datasize   Insertion Sort    Merge Sort

1000       0.07              0.03

10000      5.97              0.09

100000     611.95            0.91


As expected,  mergesort is much faster than insertion sort for large datasets.

This was expected due to the much higher time effeciency of the mergesort
algorithm.  However, the memory used by the mergesort routine was
significantly greater than that used in the insertion sort routine,
especially on the larger datasets.

The times grew as expected by the fact that insertion sort is O(n^2) and
mergesort is O(n log n).