1. Rewrite the recursive part of the merge sort algorithm presented in class to work with any container which
has random access iterators, and has an overloaded operator< for comparison of items in the container.
You will not write your own merge method. Instead you will use the STL merge algorithm.
Here is the driver for the mergesort algorithm you will write.
void mergeSort( RandItr start, RandItr end )
int sz = end – start; // or use auto sz = end-start;
typedef typename iterator_traits< RandItr >::value_type Object; //Xcode
// typedef iterator_traits< RandItr >::value_type Object; //Other compilers
// Don’t worry about this line of code