+1 (218) 451-4151
glass
pen
clip
papers
heaphones

Suppose we are given two n-element sorted sequences A and B each with distinct elements, but…

Suppose we are given two n-element sorted sequences A and B each with distinct elements, but…

Suppose we are given two n-element sorted sequences A and B each with distinct elements, but potentially some elements that are in both sequences. Describe an O(n)-time method for computing a sequence representing the union A ∪ B (with no duplicates) as a sorted sequence.