Merge sort merges neighboring sorted sub-lists two at a time. At the start, every single element counts as a sorted sub-list of length 1. Merging means repeatedly comparing the fronts of both sub-lists and taking the smaller one. Repeating this merge until only one sub-list remains leaves the whole array sorted.