MergeSort

#include<bits/stdc++.h>
using namespace std;
void merge(int a[],int lo,int mid,int hi){
    int i = lo;
    int j = mid+1;
    vector<int> v;
    while(i<=mid && j<=hi){
        if(a[i]<a[j])
        {
            v.push_back(a[i]);
            // cout<<a[i]<<" ";
            i++;
        }
        else{
            v.push_back(a[j]);
            j++;
        }
    }
    while(i<=mid)
    {
        v.push_back(a[i]);
        i++;
    }
    while(j<=hi){
        v.push_back(a[j]);
        j++;
    }
    int l = lo;
    for(int k=0;k<v.size();k++){
        a[l] = v[k];
        l++;
    }

}
void merger(int a[],int lo,int hi){
    if(lo>=hi)
        return;
    int mid = lo+(hi-lo)/2;
    merger(a,lo,mid);
    merger(a,mid+1,hi);
    merge(a,lo,mid,hi);
}
int main(){
    int n;
    cin>>n;
    int a[n];
    for(int i=0;i<n;i++)
        cin>>a[i];
    merger(a,0,n-1);
    for(int i=0;i<n;i++){
        cout<<a[i]<<" ";
    }
}