Merging two sorted sequences
Revision as of 20:03, 1 October 2014 by Cuozzo (talk | contribs) (Created page with "__NOTOC__ Category:Checkup Category:Algorithmic Problem Category:Basic Problems on Sequences ==Input== Two Sets and sequences#Ordered and sorted sequences|sorted...")
Input
Two sorted sequences, [math]\displaystyle{ S_{1} }[/math] and [math]\displaystyle{ S_{2} }[/math], that have identical component type and identical definition of comparison.
Output
A sorted sequence [math]\displaystyle{ S }[/math], whose element set is the union of the element sets of [math]\displaystyle{ S_{1} }[/math] and [math]\displaystyle{ S_{2} }[/math], sorted according to the same definition of comparison.
Objective
N/A
Complexity
Linear in the sum of the lengths of the input sequences.