算法入门||归并排序

#include <bits/stdc++.h>
using namespace std;
int a[100];
int b[100];
void Merge(int a[],int b[],int left,int mid,int right)
{
    int k=left,i=left,j=mid+1;
    while(i<=mid && j<=right)
    {
        if(a[i]<a[j])
            b[k++]=a[i++];
        else
            b[k++]=a[j++];
    }
    while(i<=mid)
    {
        b[k++]=a[i++];
    }
    while(j<=right)
    {
        b[k++]=a[j++];
    }
    for(i=left;i<=right;i++)
        a[i]=b[i];

}
void Mergesort(int a[],int left ,int right)
{
    if(left<right)
    {
        int mid = (left+right)/2;
        Mergesort(a,left,mid);//分解，求子问题
        Mergesort(a,mid+1,right);
        Merge(a,b,left,mid,right);//合并
    }
}
int main() {
    int n,i;
    cin>>n;
    for(i=0;i<n;i++)
    {
        cin>>a[i];
    }
    Mergesort(a,0,n-1);
    for(i=0;i<n;i++)
    {
        cout<<a[i]<<" ";
    }
    cout<<endl;
    return 0;
}