mergesortedarray.cpp

#include<iostream>
using namespace std;

int mergearr(int arr1[],int n,int arr2[],int m,int arr3[]){
    int i=0,j=0;
    int k=0;
    while(i<n && j<m){
            if(arr1[i]<arr2[j]){
                arr3[k]= arr1[i];
                i++;
                k++;
            
            }
            else {
                arr3[k] = arr2[j];
                j++;
                k++;
            
            }
        }
        while(i<n){
            arr3[k] = arr1[i];
            k++;
            i++;
        }
        while(j<m){
            arr3[k]=arr2[j];
            k++;
            j++;
        }
    
    for(int i=0;i<8;i++){
        printf("%d",arr3[i]);
    }
        return 0;
}


int main(){
    int arr1[]={1,3,5,7,9};
    int arr2[]={2,4,6};
    int arr3[8];
    
    mergearr( arr1, 5, arr2, 3, arr3);
}