Computational Complexity
Note that in the last example, there are 3 levels and each level requires at most N comparisons
If you have N items an unsorted list, there will be at most log(N) levels and each level will require at most N comparisons.
Therefore the total number of comparisons required to sort a list of N items using merge sort is at most N log(N)