归并排序

归并排序的简单应用

int a[10]={13,27,19,2,8,12,2,8,30,89};
int b[10];
#include <iostream>
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 MergesSort(int a[],int s,int e,int tmp[])
{
	if( s< e)
	{
		int m = s + (e-s)/2;
		MergesSort(a,s,m,tmp);
		MergesSort(a,m+1,e,tmp);
		Merge(a,s,m,e,tmp); 
	}
}
int main()
{
	int size = sizeof(a)/sizeof(int);
	MergesSort(a,0,size-1,b);
	for(int i = 0;i < size; ++i)
	{
		cout<< a[i] <<endl;
	}
	cout<<endl;
	return 0;
}