mrgsor2.x2

经典c++程序的实现

  // Do the merge operation.  First, copy 2 halves to temp.
  for (i=left; i<=mid; i++) temp[i] = array[i];
  for (j=1; j<=right-mid; j++) temp[right-j+1] = array[j+mid];
  // Merge sublists back to array
  for (i=left,j=right,k=left; k<=right; k++)
    if (temp[i] < temp[j]) array[k] = temp[i++];
    else array[k] = temp[j--];
}