ALDS1_5_B: Merge Sort

题解

1. 这里的MergeSort负责将数组分割（每层分治为两部分），Merge负责整合。
2. Merge函数将有序的left-mid和mid-right部分（都是左闭右开）整合成一个有序序列。
3. 整合过程首先用两个数组将这两部分分别装出来，然后以right-left为次数建立一个for循环，每次从两个数组中选取较小者装回原数组。可以直接用for循环操作，而不用担心一个数组已经取完了的情况，就在于这里在两个数组的末尾都添加了一个大值元素，其可以使得取完后比较继续并且不会被选中。

题目

Merge Sort
Write a program of a Merge Sort algorithm implemented by the following pseudocode. You should also report the number of comparisons in the Merge function.

Merge(A, left, mid, right)
  n1 = mid - left;
  n2 = right - mid;
  create array L[0...n1], R[0...n2]
  for i = 0 to n1-1
    do L[i] = A[left + i]
  for i = 0 to n2-1
    do R[i] = A[mid + i]
  L[n1] = SENTINEL
  R[n2] = SENTINEL
  i = 0;
  j = 0;
  for k = left to right-1
    if L[i] <= R[j]
      then A[k] = L[i]
           i = i + 1
      else A[k] = R[j]
           j = j + 1

Merge-Sort(A, left, right){
  if left+1 < right
    then mid = (left + right)/2;
         call Merge-Sort(A, left, mid)
         call Merge-Sort(A, mid, right)
         call Merge(A, left, mid, right)

Input
In the first line n is given. In the second line, n integers are given.

Output
In the first line, print the sequence S. Two consequtive elements should be separated by a space character.

In the second line, print the number of comparisons.

Constraints
n ≤ 500000
0 ≤ an element in S ≤ 109

Sample Input 1
10
8 5 9 2 6 3 7 1 10 4

Sample Output 1
1 2 3 4 5 6 7 8 9 10
34

代码块

#include <iostream>
using namespace std;

int cnt;

void Merge(int *a, int left, int mid, int right)
{
    int n1 = mid-left;
    int n2 = right-mid;
    int b1[n1+1], b2[n2+1];
    for(int i=0; i<n1; i++)
        b1[i] = a[i+left];
    for(int i=0; i<n2; i++)
        b2[i] = a[i+mid];
    b1[n1] = 2000000000, b2[n2] = 2000000000;
    int i = 0;
    int j = 0;
    for(int k=left; k<right; k++)
    {
        cnt++;
        if(b1[i]<b2[j])
            a[k] = b1[i++];
        else
            a[k] = b2[j++];
    }
}

void MergeSort(int *a, int left, int right)
{
    if(right-left>1)
    {//左闭右开的范围内至少要有两个元素
        int mid = (left+right)/2;
        MergeSort(a, left, mid);
        MergeSort(a, mid, right);
        Merge(a, left, mid, right);
    }
}

int main(void)
{
    int i, n;
    cin>>n;
    int a[n];
    for(i=0; i<n; i++)
        cin>>a[i];
    cnt = 0;
    MergeSort(a, 0, n);
    for(i=0; i<n; i++)
    {
        if(i!=n-1)
            cout<<a[i]<<' ';
        else
            cout<<a[i]<<endl;
    }
    cout<<cnt<<endl;
}