归并排序

#include <stdio.h>
#include <stdlib.h>
/*将a[low--mid-1]和a[mid--high]合并，其中mid=(low+hihg)/2
基本上网上都是传入一个额外数组，这里直接作为局部数组，不作为参数加入
*/
void mergeArray(int* a, int low, int high)
{
    int tmp[255];
    int i = low;
    int mid = (low+high)/2; /*取中间*/
    int j = mid;
    int k = 0;
    
    while (i<mid && j<high)
    {
        if (a[i] <= a[j])
        {
            tmp[k++] = a[i++];
        }
        else
        {
            tmp[k++] = a[j++];
        }
    }
    
    /*没有合并完的*/
    if (i < mid)
    {
       tmp[k++] = a[i++];
    }
    
    if (j < high)
    {
       tmp[k++] = a[j++];
    }
    
    /*赋值回到原有数组中*/
    for (i=0; i<k; i++)
    {
        a[low+i] = tmp[i];
    }
}
/*归并排序主体*/
void mergeSort(int* a, int low, int high)
{
    if (low < high)
    {
        mergeSort(a, low, (low+high)/2);
        mergeSort(a, (low+high)/2+1, high);
        mergeArray(a, low, high);
    }
}

/*TEST*/
int main()
{
    int a[] = {1, 4, 5, 2, 45, 22};
    int i;
    
    mergeSort(a, 0, 6);
    for (i=0; i<6; i++)
    {
        printf("%d ", a[i]);
    }
    printf("\n");
    return 0;
}