数据结构 二路归并排序的实现

#include<iostream>
using namespace std;

void MergeSortCore(int *a,int low,int mid,int high)
{
int *b = new int;
int i,j,k;
for(i=low,j=mid+1,k=low;i<=mid && j<=high;k++)
{
if(a[i]<a[j])
b[k] = a[i++];
else
b[k] = a[j++];
}
for(;i<=mid;i++)
b[k++] = a[i];
for(;j<=high;j++)
b[k++] = a[j];
for(i=low;i<=high;i++)
a[i] = b[i];
delete []b;
}

void MergeSort(int *a,int low,int high)
{
if(low<high)
{
int mid = low+(high-low)/2;
MergeSort(a,low,mid);
MergeSort(a,mid+1,high);
MergeSortCore(a,low,mid,high);
}
}

int main()
{
int a[]={46,38,56,30,88,80,38};
MergeSort(a,0,6);
for(int i=0;i<7;i++)
cout<<a[i]<<" ";
cout<<endl;
return 0;

}

运行结果：