归并排序

归并排序，用C++实现，归并排序与堆排序时间复杂度都是O(NlogN)

/************************************************************************/
/* 归并排序
/* 最大时间复杂度O(NlogN)
/************************************************************************/
#include <stdio.h>

void Merge(int* array, int * tmpArray, int left, int center, int right)
{
    int LeftCount = left;
    int RightCount = center + 1;
    int i = 0;
    int NumElement = right - left + 1;

    //依次从两个数组中取元素
    while (LeftCount <= center && RightCount <= right)
    {
        if (array[LeftCount] < array[RightCount])
        {
            tmpArray[i++] = array[LeftCount++];
        }
        else
        {
            tmpArray[i++] = array[RightCount++];
        }
    }

    //将剩余的元素放入临时数组
    if (LeftCount <= center)
    {
        while (LeftCount <= center)
        {
            tmpArray[i++] = array[LeftCount++];
        }
    }
    else
    {
        while (RightCount <= right)
        {
            tmpArray[i++] = array[RightCount++];
        }
    }

    //将元素从零时数组拷贝至原数组
    for (int j = 0; j < NumElement ;)
    {
        array[left++] = tmpArray[j++];
    }
}

void MergeSort(int* array, int *tmpArray, int left, int right)
{
    int center = (right + left) / 2;
    if (left < right)
    {
        MergeSort(array, tmpArray, left, center);
        MergeSort(array, tmpArray, center + 1, right);
        Merge(array, tmpArray, left, center, right);
    }
}

int main()
{
    int array[10] = {10, 45, 78, 32, 89, 18, 105, 953, 243, 19};
    int* temp = new int[10];
    MergeSort(array, temp, 0, 9);
    int i = 0;
    int j = sizeof(array) / sizeof(int);
    while (i < j)
    {
        printf("%d     ", array[i++]);
    }
    return 0;
}