Você está na página 1de 2

//Merge Shot (ascending and descending)

//Date- 29/8/2015
#include<iostream.h>
#include<conio.h>

void Merge(int a[ ], int m, int b[],int n, int c[ ])


{int i=0;
int j=n-1;
int k=0;
while(i<m&&j>=0)
{if(a[i]<b[j])
c[k++]=a[i++];
else
c[k++]=b[j--];
}
while(i<m)
c[k++]=a[i++];
while(j>=0)
c[k++]=b[j--];
}
void main()
{
clrscr();
int a[5],m=5;
int b[6],n=6;
int c[11];
cout<<"\nEnter first array in ascending order";
for(int x=0;x<m;x++)
cin>>a[x];
cout<<"\nEnter second array in descending order";
for(int y=0;y<n;y++)
cin>>b[y];
Merge(a, m, b, n, c);

cout<<"The merged array is :\n";


for(int i=0; i<m+n; i++)
cout<<c[i]<", ";
getch();
}
/**************************OUTPUT*******************************************

Enter first array in ascending order1


2
4
6
8

Enter second array in descending order9


7
6
5
3
2
The merged array is :
12234566789
*/

Você também pode gostar