Recursion Trees

Internal

• Recursive Algorithms Complexity
• Merge Sort

Overview

The idea behind the recursion tree method is to write out the work done by the recursive algorithm in a tree structure, where the children of a given node represent the recursive calls made by that node. The tree will facilitate counting the overall work done by the algorithm and facilitate the analysis.

Recursion Tree Example for Merge Sort

For merge sort, at each level we sub-divide the problem in 2, we sort recursively, and then we merge the results of the recursive calls with a Θ(n) procedure. If we represent each recursive call as a level in a tree, where the nodes represent the size of the subproblems, we get something similar to:

The tree has 1 + log₂n levels: the bottom-most level m is equals to log₂n because the problem size is decreased by a factor of 2 at each level of recursion, and the bottom-most level problem size is 1, so:

1 = n/2m → n = 2m → m = log2n

The analysis reveals that at the level j of the recursion there are 2^j subproblems and each subproblem has a size of n/2^j.

The total amount of work done by the algorithm at level j is proportional with the numbers of subproblems and the amount of work per subproblem:

      n
2j c ──── = c n = Θ(n)
      2j

The total amount of work is:

(1 + log2n)⋅c⋅n = Θ(n log2n)

[Next]