← All examples

Fibonacci numbers

Python Recursion

double recursion

Flowchart (ISO 5807)

YesNoStartInput nn < 2Return nEndReturn fib(n - 1) + fib(n - 2)EndFigure 1 — fib

Source code

def fib(n):
    if n < 2:
        return n
    return fib(n - 1) + fib(n - 2)