Question

- LILOPOULOULU 5. You are given two arrays each of which is sorted. Write a method called mergelt that takes the two arrays and merges them into one array. For instance, if you had 5. 9. 11 and 4, 6, 7 then you need to merge it to 4,5,6,7,9,11

can you do this question in C++.

Answer 1

#include <bits/stdc++.h>
using namespace std;
int merge(int a[],int n, int b[], int m)
{
int c[n+m];
int i=0,j=0,k=0;
while((i<n)&&(j<m))
{
if(a[i]<=b[j])
{
c[k++]=a[i++];
}
else if (a[i]>b[j])
{
c[k++]=b[j++];
}
}
while(i<n)
c[k++]=a[i++];
while(i<m)
c[k++]=b[j++];
  
for(int i=0;i<n+m;i++)
cout<<c[i] <<" ";
return 0;
}

int main()
{
int a[]={1,2,3,7,8};
int b[]= {4,6,7};
merge(a,5,b,3);
return 0;
}