RecursiveMergeSort

This program uses recursion to merge sort an array. It takes as input an array to be sorted that has been memory allocated onto the heap and the size of the array. It will return a sorted array that has been alocated on the heap. It might be the original array or a new array. Memory that is not returned will be freed. A main is provided to show an example of the program, and the time it takes.