Recursion Tree

Starting to get closer to an ``automated'' approach.

Take .

Imagine recursion unfolding as a tree.

tex2html_wrap399

A harder version: T(n) = T(n/3)+T(2n/3)+n.

tex2html_wrap401

$next$ $up$ $previous$
Next: Summary Up: SOLVING RECURRENCES Previous: The Table Method