归并排序的实现

#include<iostream>
using namespace std;

void mergearray(int a[],int begin,int mid,int end,int temp[])
{
	int i=begin,j=mid+1,k=0;
	while(i<=mid&&j<=end)
	{
		if(a[i]<a[j])
			temp[k++]=a[i++];
		else
			temp[k++]=a[j++];
	}
	while(i<=mid)
		temp[k++]=a[i++];
	while(j<=end)
		temp[k++]=a[j++];
	for(int i=0;i<k;i++)
		a[begin+i]=temp[i];
}

void mergesort(int a[],int begin,int end,int temp[])
{
	if(begin<end)
	{
		int mid=(begin+end)>>1;
		mergesort(a,begin,mid,temp);
		mergesort(a,mid+1,end,temp);
		mergearray(a,begin,mid,end,temp);
	}
}

int main()
{
	int a[]={10,2,38,123,64,52,59,40};
	int size = sizeof(a)/sizeof(a[0]);
	int *temp=new int[size];
	mergesort(a,0,size-1,temp);

	for(int i=0;i<8;i++)
		cout<<a[i]<<" "<<endl;
	return 0;
}