C++实现自顶向下的二路归并排序

#include<stdio.h>
#include<malloc.h>
void disp(int a[],int n)
{
int i;
for(i=0;i<n;i++)
{
printf("%d “,a[i]);
}
printf(”\n");
}
void Merge(int a[],int low,int mid,int high)
{
int *tmpa;
int i=low,j=mid+1,k=0;
tmpa=(int *)malloc((high-low+1)*sizeof(int));
while(i<=mid&&j<=high)
{
if(a[i]<=a[j])
{
tmpa[k]=a[i];
i++;k++;
}
else
{
tmpa[k]=a[j];
j++;k++;
}
}
while(i<=mid)
{
tmpa[k]=a[i];
i++;k++;
}
while(j<=high)
{
tmpa[k]=a[j];
j++;k++;
}
for(k=0,i=low;i<=high;k++,i++)
{
a[i]=tmpa[k];
}
free(tmpa);
}
void MergeSort(int a[],int low,int high)
{
int mid;
if(low<high)
{
mid=(low+high)/2;
MergeSort(a,low,mid);
MergeSort(a,mid+1,high);
Merge(a,low,mid,high);
}
}
int main()
{
int n=5;
int a[]={2,1,4,5,0};
printf(“排序前：”);
disp(a,n);
MergeSort(a,0,n-1);
printf(“排序后：”);
disp(a,n);
}