Chapter 4: Orders of Growth and Tree Recursion

Analyzing Merge Sort 4

Since n cards are handled on each of log₂n + 1 passes, the total number of handlings H(n) is:

H(n) = n(log₂n + 1)
= nlog₂n + n