归并排序2

#include <stdio.h>
#include<stdlib.h>
void merging(int a[],int begin,int mid,int end)
{
    int *tmp = (int *)malloc(sizeof(int)*(end - begin + 1));
    int i,j,k;
    i = begin;
    j = mid + 1;
    k = 0;

    while(i <= mid && j <=end)
    {
        if(a[i] < a[j])
            tmp[k++] = a[i++];
        else
            tmp[k++] = a[j++];
    }

    while(i <= mid)
        tmp[k++] = a[i++];
    while(j <= end)
        tmp[k++] = a[j++];

    for(i = 0;i < k;i++)
    {
        a[begin + i] = tmp[i];
    }
    free(tmp);

}
void merge_sort(int a[],int begin,int end)
{
    int mid;
    if(a == NULL || begin >= end)
        return;
        mid = (begin + end) / 2;
        merge_sort(a,begin,mid);
        merge_sort(a,mid + 1,end);
        merging(a,begin,mid,end);

}
int main()
{
    int i,length;
    int a[10] = {0};
    printf("enter 10 num...\n");
    for(i = 0;i < 10;i++)
    {
        scanf("%d",&a[i]);
    }
    length = sizeof(a)/sizeof(int);
    
    merge_sort(a,0,length - 1);
    
    for(i = 0;i < length;i++)
    {
        printf("%d  ",a[i]);
    }
    return 0;
}