Bottom-Up Mergesort Analysis
lAt each ÒlevelÓ O(n) steps are used.
lThere are log(n) levels.
lTherefore mergesort is O(n log(n)) worst case.