Question

Suppose we are given two n-element sorted sequences A and B that may contain duplicate entries. Describe an O(n)-time method for computing a sequence representing all elements in A or B with no duplicates.

Answer 1

#include <bits/stdc++.h>
using namespace std;
int MergeSortedSeq(int A[], int B[], int m, int n)
{

int i = 0, j = 0;
while (i < m && j < n)
{
if (A[i] < B[j])
cout << A[i++] << " ";
  
else if (B[j] < A[i])
cout << B[j++] << " ";
  
else
{
cout << B[j++] << " ";
i++;
}
}
  

while(i < m)
cout << A[i++] << " ";
  
while(j < n)
cout << B[j++] << " ";
}
  

int main()
{
int A[] = {0,1,2,3,6,8};
int B[] = {3,4,5,8,9,11,12};
  
int m = sizeof(A)/sizeof(A[0]);
int n = sizeof(B)/sizeof(B[0]);
  

MergeSortedSeq(A, B, m, n);
  
return 0;
}