View source for Merging two sorted sequences

__NOTOC__
[[Category:Checkup]]
[[Category:Algorithmic Problem]]
[[Category:Basic Problems on Sequences]]
==Input==
# Two [[Sets and sequences#Ordered and sorted sequences|sorted sequences]], <math>S_{1}</math> and <math>S_{2}</math>, that have identical component type.
# A [[Genericity#Comparison|comparison]] on this component type.

==Output==
A sorted sequence <math>S</math>, whose element set is the union of the element sets of <math>S_{1}</math> and <math>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.

==Known algorithms==
[[Merge]]