Merge Sort is dividing the list in half over and over again until each piece is only one item long. Then those items are put back together (merged) in sort-order.

To implement the algorithm, we will need a merge function, that will join the two parts of the list together in sorted order.