归并排序MergeSort

归并排序是建立在归并操作上的一种有效的排序算法。该算法是采用分治法（Divide and Conquer）的一个非常典型的应用，归并排序将两个已排序的表合并成一个表。
将序列2分至单个元素，将2分的序列归并（按序保存在缓存空间，最后保存会原序列）

void MergeSort(int* a, int len)
{
    MSort(a, 0, len - 1);
}

void MSort(int* a, int left, int right)
{
    if (left < right)
    {
        int mid = (left + right) / 2;
        MSort(a, left, mid);
        MSort(a, mid + 1, right);
        Merge(a, left, mid, right);
    }
}

void Merge(int* a, int left, int mid, int right)
{
    int* pb = new int[right - left + 1];
    int* pleft = &a[left];
    int* plend = &a[mid];
    int* pright = &a[mid + 1];
    int* prend = &a[right];
    while (pleft<=plend && pright<=prend)
    {
        if (*pleft > *pright) *pb++ = *pright++;
        else *pb++ = *pleft++;
    }
    while (pleft <= plend) *pb++ = *pleft++;
    while (pright <= prend) *pb++ = *pright++;
    pleft = &a[left];
    for (; pleft < pright;) *--pright = *--pb;
    delete [] pb;
}