C++ Merge Sort

Assume Msort() is as follows:

void Msort(int aVec[], int aLen) { int *tmp = new int[aLen]; mergeSort(aVec, tmp, 0, aLen - 1); delete [] tmp; }

Implement mergeSort algorithm for arrays (duplicates are not allowed).

int mergeSort(int aVec[], int tmp[], int lo, int hi) {