previous | index | next

Tree Recursion Efficiency (cont'd)

Time required for tree recursive power is Θ(e).

Q: What is the maximum number of waiting multiplications?

A: 4 multiplications

Q: What is the maximum number of waiting multiplications (in terms of e)?

previous | index | next