Recursive MergeSort Algorithm

mergeSort.java

void MergeSort(Vector<int> &v){
  if (v.size() > 1) {
    int n1 = v.size()/2;
    int n2 = v.size() - n1;
    Vector<int> left = Copy(v, 0, n1); Vector<int> right = Copy(v, n1, n2); MergeSort(left);
    MergeSort(right);
    Merge(v, left, right);
  }
}