##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Two recursive calls
The Fibonacci sequence is: Each number is the sum of the two before it.
Given , find the -th Fibonacci number. plaintext fib(0) = 0 fib(1) = 1 fib(n) = fib(n-1) + fib(n-2) plaintext Input: 6 Output: 8 (sequence: 0, 1, 1, 2, 3, 5, 8) Input: 10 Output: 55 This problem needs TWO base cases because the recursive case references two previous values.
