模板
#include<cstdio>
#include<iostream>
using namespace std;
const int MAXN = 100;
int a[MAXN];
void Merge(int left,int mid,int right)
{
int i = left; int j = mid + 1; int cnt = left;// 注意细节,对模型的不细致理解。
int temp[MAXN];
while(i <= mid && j <= right) temp[cnt++] = a[i] < a[j] ? a[i++] : a[j++];
while(i <= mid) temp[cnt++] = a[i++];
while(j <= right) temp[cnt++] = a[j++];
for(int i = left;i <= right;++i) a[i] = temp[i];
return ;
}
void mergesort(int l,int r)
{
if(l < r)
{
int m = (l + r) / 2;
mergesort(l,m);
mergesort(m + 1,r);
Merge(l,m,r);
}
return ;
}