Lab task - (Array - 1)

#include <bits/stdc++.h>

#define ll long long
#define ull unsigned long long
#define uom unordered_map
#define pb push_back
#define yes cout<<"YES\n"
#define no cout<<"NO\n"

#define dot(x) fixed<<setprecision(x)
#define wrench786 ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

#define PI (acos(-1.0))
#define eps 0.00001
const int LIMIT = 10000*500;
const int mod = 1000000007;
using namespace std;

int main(){
    int n1,n2,i,j;
    cout<<"Size of Array – 1: N1 ="<<endl;
    cin>>n1;
    int arr1[n1];
    cout<<"Enter "<<n1<<" array elements"<<endl;
    for(i=0;i<n1;i++){
        cin>>arr1[i];
    }

    cout<<"Size of Array – 2: N2 ="<<endl;
    cin>>n2;
    int arr2[n2];
    cout<<"Enter "<<n2<<" array elements"<<endl;
    for(i=0;i<n2;i++){
        cin>>arr2[i];
    }

    int arr3[n1+n2];
    for(i=0;i<n1;i++){
        arr3[i]= arr1[i];
    }

    for(j=0;j<n2;j++,i++){
        arr3[i]= arr2[j];
    }

    for(i=0;i<n1+n2-1;i++){
        for (j = 0; j < n1+n2-i-1; j++){
            if (arr3[j] > arr3[j+1]) swap(arr3[j], arr3[j+1]);
        }
    }
    cout<<"Merged Array in Sorted order"<<endl;
    for(i=0;i<n1+n2;i++){
        cout<<arr3[i]<<" ";
    }

}