The Fibonacci Series

- fib(5) = fib(4) + fib(3)

- fib(4) = fib(3) + fib(2)

- fib(3) = fib(2) + fib(1)

-fib(2) = fib(1) + fib(0)

- (2) = fib(1) + fib(0)

- (3) = fib(2) + fib(1)

- fib(2) = fib(1) + fib(0).

public int fib(int n) {

if (n == 0)

return 0;

else if (n == 1)

return 1;

else

return fib(n - 1)

+ fib(n - 2);

}

See if you can map out how fib(6) reveals the growing ineffiency of this recursive algorithm