← All examples

Fibonacci numbers

Go Recursion

double recursion

Flowchart (ISO 5807)

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

Source code

func fib(n int) int {
    if n < 2 {
        return n
    }
    return fib(n-1) + fib(n-2)
}