归并排序 归并排序示例

#include<iostream>
using namespace std;

void guibing(int* a,int low,int m,int high)
{
int i,j,*p,*s;
p=(int*)malloc((high+1-low)*sizeof(int));
s=p;
i=low,j=m+1;
while(i<=m&&j<=high)
{
if(a[i]<a[j])
*s++=a[i++];
else
*s++=a[j++];
}
while(i<=m)
*s++=a[i++];
while(j<=high)
*s++=a[j++];
s=p;
for(i=low;i<=high;i++)
a[i]=*s++;
free(p);
}

void merge_sort(int *a,int low,int high)
{
if(low<high)
{