A recursive Fibonacci
❮ Decorator to register function trace fibo ❯
examples/decorators/fibo.py
def fibo(n): if n in (1,2): return 1 return fibo(n-1) + fibo(n-2) print(fibo(5)) # 5