Combine two or more sorted sequences of data into a single sorted sequence. Formal Definition: For simplicity, let input be two sequences, A=(a₁, ..., a_n) and B=(b₁, ..., b_m), each sorted according to some total order, ≤. The output is a single sequence, merge(A,B), which is a sorted permutation of (a₁, ..., a_n, b₁, ..., b_m).