Fibonacci numbers
Python Recursion
double recursion
Flowchart (ISO 5807)
Source code
def fib(n):
if n < 2:
return n
return fib(n - 1) + fib(n - 2) double recursion
def fib(n):
if n < 2:
return n
return fib(n - 1) + fib(n - 2)