merge sorting 2 arrays
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
#include <iostream>
#include<vector>
#include<iterator>
using namespace std;
//merge sorting two arrays
int main() {
int n,m,x,i;
cin>>n>>m;
int a[100],b[100];
int j;
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<m;i++)
cin>>b[i];
vector<int> c;
vector<int>::iterator ptr;
for(i=0,j=0;i<m,j<m;)
{
if(i<n)
{
if(a[i]<b[j])
{
c.push_back(a[i]);
i++;
}
else if(a[i]>b[j])
{
c.push_back(b[j]);
j++;
}
else
{
c.push_back(a[i]);
c.push_back(b[j]);
i++;
j++;
}
}
else
{ c.push_back(b[j]);
j++;
}
}
for(ptr=c.begin();ptr<c.end();++ptr)
cout<<*ptr<<" ";
return 0;
}
Cpp
INFO