归并排序c语言

#include<stdio.h>
#include<stdlib.h>
int a[7]={49,38,65,97,76,13,27};
int *B;
void Merge(int a[],int low,int mid,int high);
void MergeSort(int a[],int low,int high);
void display(int a[],int len);
int main(){
    B=(int *)malloc(8*sizeof(int));
    printf("排序前:");
    display(a,7);
    MergeSort(a,0,6);
    printf("排序后:");
    display(a,7);
    return 0;
}

void Merge(int a[],int low,int mid,int high){//表中a[low]~a[mid]与a[mid+1]~a[high]各自有序
    int i,j,k;
    for(k=low;k<=high;k++)
        B[k]=a[k];//将a表复制到b表
    for(i=low,j=mid+1,k=i;i<=mid && j<=high;k++){
        if(B[i]<=B[j])//比较B的左右两段中的元素
            a[k]=B[i++];//将较小的复制到a中
        else
            a[k]=B[j++];
    }
    while(i<=mid)a[k++]=B[i++];
    while(j<=high)a[k++]=B[j++];
}

void MergeSort(int a[],int low,int high){
    if(low<high){
        int mid=(low+high)/2;
        MergeSort(a,low,mid);//
        MergeSort(a,mid+1,high);
        Merge(a,low,mid,high);//归并
    }
}

void display(int a[],int len){
    for(int i=0;i<len;i++)
        printf("%d\t",a[i]);
    printf("\n");
}