Method Union

Arrays/18_Menu_Based_problem.cpp:255–282

 return arr3;
}
Array* Array::Union(Array arr2)
{
 int i,j,k;
 i=j=k=0;

 Array *arr3=new Array(length+arr2.length);

 while(i<length && j<arr2.length)
 {
 if(A[i]<arr2.A[j])
 arr3->A[k++]=A[i++];
 else if(arr2.A[j]<A[i])
 arr3->A[k++]=arr2.A[j++];
 else
 {
 arr3->A[k++]=A[i++];
 j++;
 }
 }
 for(;i<length;i++)
 arr3->A[k++]=A[i];
 for(;j<arr2.length;j++)
 arr3->A[k++]=arr2.A[j];

 arr3->length=k;

 return arr3;
}
Array* Array::Inter(Array arr2)
{
 int i,j,k;