归并排序模板

话不多说，算法靠背加理解，不懂私聊问

# include<iostream>
# include<stdio.h>
using namespace std;
int arr[10000];
int tmp[10000];
void merge(int q[],int l,int r)
{
	if(l>=r)return;
	int mid=(l+r)/2;
	merge(q,l,mid);
	merge(q,mid+1,r);
	int i=l;
	int j=mid+1;
	int k=0;
	while(i<=mid&&j<=r)
	{
		if(q[i]<=q[j])
		{
			tmp[k++]=q[i++];
		}
		else
		{
			tmp[k++]=q[j++];
		}
	}
	while(i<=mid)
	{
		tmp[k++]=q[i++];
	}
	while(j<=r)
	{
		tmp[k++]=q[j++];
	}
	for(i=l,j=0;i<=r;i++,j++)
	{
		q[i]=tmp[j];
	}
}
int main()
{
	int n,i;
	cin>>n;
	for(i=0;i<n;i++)
	{
		cin>>arr[i];
	}
	merge(arr,0,n-1);
	for(i=0;i<n;i++)
	{
		cout<<arr[i];
	}
	return 0;
}