-归并排序

1。分解待排序的n个元素，使各为n/2个元素。

2。递归解决每个子问题。

3。合并解决的子问题。

代码解决:

#include <iostream>
#define inf 0x3f3f3f3f
using namespace std;
int Meg(int A[], int p, int q, int r)
{
    int n1 = q - p + 1, n2 = r - q;
    int L[n1 + 2], R[n2 + 2];
    for (int i = 1; i <= n1; i++)
    {
        L[i] = A[p + i - 1];
    }
    for (int i = 1; i <= n2; i++)
    {
        R[i] = A[q + i];
    }
    L[n1 + 1] = inf;
    R[n2 + 1] = inf;
    int i = 1, j = 1;
    for (int s = p; s <= r; s++)
    {
        if (L[i] <= R[j])
        {
            A[s] = L[i];
            i = i + 1;
        }
        else
        {
            A[s] = R[j];
            j = j + 1;
        }
    }
    return 0;
}
int Meg_Sort(int A[], int p, int r)
{
    if (p < r)
    {
        int q = (p + r) >> 1;
        Meg_Sort(A, p, q);
        Meg_Sort(A, q + 1, r);
        Meg(A, p, q, r);
    }
    return 0;
}
int main()
{
    int q;
    cin >> q;
    int B[q + 1];
    for (int i = 1; i <= q; i++)
        cin >> B[i];
    Meg_Sort(B, 1, q);
    for (int i = 1; i <= q; i++)
    {
        cout << B[i] << " \n"[i == q];
    }
    return 0;
}