In C++ Write an IterativeMergeSort function given these parameters and following the prompt
IterativeMergeSort(vector v, int low, int high)
IterativeMergeSort
In-place sorting refers to sorting that does not require extra memory arrays. For example, QuickSort performs partitioning operations by repeating a swapping operation on two data items in a given array. This does not require an extra array.
We can improve the performance of MergeSort by utilizing a non-recursive method and using only one additional array (instead of one array on each recursive call). In this improved version of MergeSort, IterativeMergeSort, one would merge data from the original array into the additional array and alternatively copy back and forth between the original and the additional temporary array.
Please re-read the last sentence as it is critical to the grading of the lab.
For the IterativeMergeSort we still need to allow data items to be copied between the original and this additional array as many times as O(logn). However, given the iterative nature we are not building up state on the stack.