A list containing a single element is, by definition, sorted. Recursively divide the list into sublists of (roughly) equal length, until each sublist contains only one element, or in the case of iterative (bottom up) merge sort, consider a list of n elements as n sub-lists of size 1.Conceptually, the merge sort algorithm consists of two steps:
The merge algorithm plays a critical role in the merge sort algorithm, a comparison-based sorting algorithm.
