Merge Sort
Divide: Divide the n element sequence to be sorted into two sub sequences of n/2 elements each
Conquer: Sort the two sub sequences recursively using merge sort
Combine: Merge the two sorted sub sequences to produce a sorted answer
Note: The recursion bottoms out when the length of the sequence to be sorted is 1.