'Fib n' presentation slideshows

Tree Recursion

Tree Recursion. Traditional Approach. Tree Recursion. Consider the Fibonacci Number Sequence: Time: 0 1 2 3 4 5 6 7 8 0, 1, 1, 2, 3, 5, 8, 13, 21, ... / 0 when n = 0 fib(n) = | 1 when n = 1 fib(n - 1) + fib(n - 2) otherwise. Tree Recursion (cont.). As code this is:

352 views • 23 slides