C++ 归并排序

#include<iostream>
using namespace std;
int a[10001],b[10001];
void msort(int x,int y)
{
	int i,j,k;
	if (x==y) return;
	int mid=(x+y)/2;
	msort(x,mid);
	msort(mid+1,y);
	i=x;
	j=mid+1;
	k=x;
	while (i<=mid&&j<=y)
	{
		if (a[i]<=a[j])
		{
			b[k]=a[i];
			k++;
			i++;
		}
		else
		{
			b[k]=a[j];
			j++; 
			k++; 
		}
	}
	while (i<=mid)
	{
		b[k]=a[i];
		k++;
		i++;
	}
	while (j<=y)
	{
		b[k]=a[j];
		k++;
		j++;
	}
	for (i=x;i<=y;i++) a[i]=b[i];
}
int main()
{
	int n,i;
	cin>>n;
	for (i=1;i<=n;i++) cin>>a[i];
	msort(1,n);
	for (i=1;i<=n;i++) cout<<a[i]<<" ";
	return 0;
}