Merge Sort.

 #include<iostream>

using namespace std;


int main()

{

int a[250],b[250],c[250];

int m,n;

int i,j,k;

cout<<"\nENTER THE SIZE FOR ARRAY-1 :";

cin>>m;

for(i=0;i<m;i++)

{

cout<<"\nELEMENT OF ARRAY -1 IS: ";

cin>>a[i];

}

cout<<"\nENTER THE SIZE FOR ARRAY-2: ";

cin>>n;

for(j=0;j<n;j++)

{

cout<<"\nENTER ELEMENT FOR ARRAY - 2: ";

cin>>b[j];

}

i = j= k = 0;

while(i<m&&j<n)

{

if(a[i]<b[j])

{

c[k]=a[i];

i++;

}

else

{

c[k]=b[j];

j++;

}

k++;

}

while(i<m)

{

c[k]=a[i];

i++;

k++;

}

while(j<n)

{

c[k]=b[j];

j++;

k++;

}

cout<<"\nACCENDING ORDER ARRAY IS : ";

for(i=0;i<k;i++)

{

cout<<" "<<c[i];

}

return 0;

}