Marge two sorted array

#include <iostream>
#include <bits/stdc++.h>
using namespace std;


void margeArray(int arr1[], int arr2[], int size_arr1,int size_arr2, int arr3[]){
    int i=0, j=0, k=0;
    while(i < size_arr1){
        arr3[k++] = arr1[i++];
    }
    while(j < size_arr2){
        arr3[k++] = arr2[j++];
    }

    sort(arr3,arr3+size_arr1+size_arr2);
}
int main(){
    int arr1[] = {1,2,5,6,8};
    int size_arr1 = sizeof(arr1) / sizeof(int);
    int arr2[] = {9,7,3,4};
    int size_arr2 = sizeof(arr2) / sizeof(int);

    int arr3[size_arr1+size_arr2];

    margeArray(arr1,arr2,size_arr1,size_arr2,arr3);

    cout<<"Array after marge"<<endl;
    for(int i=0; i < size_arr1+size_arr2; i++){
        cout<<arr3[i]<<" ";
    }
    return 0;
}