Merge algorithms are a family of
algorithms that take multiple
sorted lists as input and produce a single list as output, containing all the elements of the inputs lists in sorted order. These algorithms are used as
subroutines in various
sorting algorithms, most famously
merge sort.