c++中的归并排序函数

#include<bits/stdc++.h>
using namespace std;

template<class T>
void Merge(T* pSrc, T* pDst, int low, int mid, int high)
{
    int i = low, j = mid + 1, k = low;
    while (i <= mid && j <= high)
    {
        if (pSrc[i] <= pSrc[j])
        {
            pDst[k] = pSrc[i];
            i++;
        }
        else
        {
            pDst[k] = pSrc[j];
            j++;
        }
        k++;
     }
    while (i <= mid)
    {
        pDst[k] = pSrc[i];
        i++;
        k++;
    }
    while (j <= high)
    {
        pDst[k] = pSrc[j];
        j++;
        k++;
    }
}
template<class T>
void MergePass(T* pSrc, T* pDst, int nsize, int nLength)
{
    int i, j;
    for (i = 0; (i + 2) * nLength < nsize; i+=2)
        Merge(pSrc, pDst, i * nLength , (i + 1) * nLength-1, (i + 2) * nLength-1);
    if ((i + 1) * nLength < nsize)
        Merge(pSrc, pDst, i * nLength , (i + 1) * nLength-1, nsize-1);
    else
    {
        for (j = i * nLength ; j <=nsize; j++)
            pDst[j] = pSrc[j];
    }
}
template<class T>
void MergeSort(T R[], int nSize)
{
    int nLength;
    T* MR = new T[nSize + 1];
    T* pSrc = R, * pDst = MR, * p;
    int i;
    if (MR == NULL)
        exit(1);
    for (nLength = 1; nLength < nSize; nLength *= 2)
    {
        MergePass(pSrc, pDst, nSize, nLength);
        p = pSrc;
        pSrc =pDst;
        pDst = p;
    }
    if (pSrc != R)
    {

        for (i = 0; i < nSize; i++)
            R[i] = MR[i];
    }
    delete[]MR;
}
int main()
{
    int A[] = {43,56,37,28,17,37,22,30,2 };
    MergeSort(A, 9);
    for(int i=0;i<9;i++)
        cout<<A[i]<<',';
    return 0;
}
 

 

 

 

因为pSrc和pDsr要对换 A.size()/2 向上取整次

 只要  A.size()/2 向上取整 是奇数 就要执行那句if  是偶数 就不执行