Question

Consider A, B, C as three arrays of size m,n and m + n respectively. Array A is stored in ascending orderwhereas array B is stored in descending order. Write a C++ program to produce a third array C, containingall the data of arrays A and B and arranged in descending order. Display the data of array C only.

Answer 1

#include<iostream>

using namespace std;

void Merge(int A[], int B[], int C[], int N, int M, int &K);

int main()

{

int A[100], B[100], C[200],i,n,m,k;

cout<<"\nEnter number of elements you want to insert in first array ";

cin>>n;

cout<<"Enter element in ascending order\n";

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

{

 cout<<"Enter element "<<i+1<<":";

 cin>>A[i];

}

cout<<"\nEnter number of elements you want to insert in second array ";

cin>>m;

cout<<"Enter element in descending order\n";

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

{

 cout<<"Enter element "<<i+1<<":";

 cin>>B[i];

}

Merge(A,B,C,n,m,k);

cout<<"\nThe Merged Array in Ascending Order"<<endl;

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

{

 cout<<C[i]<<" ";

}

return 0;

}

void Merge(int A[], int B[], int C[], int N, int M, int &K)

{

int I=0, J=M-1;

K=0;

while (I<N && J>=0)

{

 if (A[I]<B[J])

  C[K++]=A[I++];

 else if (A[I]>B[J])

  C[K++]=B[J--];

 else

 {

  C[K++]=A[I++];

  J--;

 }

}

for (int T=I;T<N;T++)

 C[K++]=A[T];

for (int T=J;T>=0;T--)

 C[K++]=B[T];

}