MergeSort.cpp

Algorithm MergeSort(arr, l, h)
{
    if(low < high) then
    {
      mid := (low + high) / 2; 
      MergeSort(arr, low, mid); 
      MergeSort(arr, mid+1, high);
      Merge(arr, low, mid, high);
    }
}