排序算法之归并排序

#include
using namespace std;
void Merge(int a[],int s,int m,int e,int tmp[]){
	int pb=0;
	int p1=s,p2=m+1;
	while(p1<=m && p2<=e){
		if(a[p1]<a[p2])
			tmp[pb++] = a[p1++];
		else
			tmp[pb++] = a[p2++];
	}
	while(p1<=m)	tmp[pb++] = a[p1++];
	while(p2<=e)    tmp[pb++] = a[p2++];
	for(int i=0;i<e-s+1;++i)
		a[s+i] = tmp[i];
}
void MergeSort(int a[],int s,int e,int tmp[])
{
	if(s<e){
		int m = s+(e-s)/2;
		MergeSort(a,s,m,tmp);
		MergeSort(a,m+1,e,tmp);
		Merge(a,s,m,e,tmp);
	}
}

int a[10] = {10,9,8,7,6,5,4,3,2,1};
int b[10];
int main()
{
	int size=sizeof(a)/sizeof(int);
	MergeSort(a,0,size-1,b);
	for(int i=0;i<size;++i)
		cout << a[i] << "," << endl;
	return 0;
}