归并排序

第一次自己动手写归并排序并实现计算逆序数。给出代码：

#include<iostream>
using namespace std;
int num_of_inversions;//逆序数的个数
void _merge(int arr[],int s,int mid,int e)
{
	int *temp=new int[e-s+1];
	int i,j,k=0;
	for( i=s,j=mid+1;i<=mid && j<=e; )
	{
		if(arr[i]<=arr[j])
		{
			temp[k++]=arr[i];
			i++;
		}
		else
		{
			temp[k++]=arr[j];
			j++;
			num_of_inversions+=mid-i+1;//这一步专为求逆序数而加，去掉的话就是纯粹的归并排序了
		}
	}
	for(;i<=mid;i++)
		temp[k++]=arr[i];
	for(;j<=e;j++)
		temp[k++]=arr[j];
	for(i=0;i<k;i++)
		arr[i+s]=temp[i];
	delete []temp;
}
void _sort(int arr[],int s,int e)
{
	int mid=(s+e)/2;
	if(s<e)
	{
		_sort(arr,s,mid);
		_sort(arr,mid+1,e);
	}
	_merge(arr,s,mid,e);
}
int main()
{
	int n;
	int *num;
	int i;
	while(cin>>n && n>0)
	{
		num_of_inversions=0;//逆序数个数初始化为零
		num=new int[n];
		for(i=0;i<n;i++)
			cin>>num[i];
		_sort(num,0,n-1);
		for(i=0;i<n;i++)
			cout<<num[i]<<' ';
		cout<<endl;
		cout<<"The number of inversions is: "<<num_of_inversions<<endl;
		delete []num;
	}
	return 0;
}