Author: Thomas H. Cormen

  • loc 982 - We will endeavor to avoid such gray areas in the RAM model, but we will treat computation of 2k as a constant-time operation when k is a small enough positive integer.

  • loc 1093 - We usually consider one algorithm to be more efficient than another if its worst-case running time has a lower order of growth.

  • loc 1278 - The cost for each of the two subnodes at the second level of recursion is cn/2. We continue expanding each node in the tree by breaking it into its constituent parts as determined by the recurrence, until the problem sizes get down to 1, each with a cost of c. Part (d) shows the resulting tree.