Recursion

← Back to documentation

Description

A function that calls itself is called recursive. Jaf supports recursion.

Examples

Factorial

func factorial(n) {
    if (n == 0) {
        1
    } else {
        n * factorial(n - 1)
    }
}
print(factorial(5))
# Output: 120

Fibonacci

func fib(n) {
    if (n == 0) {
        0
    } else {
        if (n == 1) {
            1
        } else {
            fib(n - 1) + fib(n - 2)
        }
    }
}
print(fib(7))
# Output: 13

Notes

• Recursion depth is limited by Java stack (usually ~10,000 calls)
• Very deep recursion may cause stack overflow
• Tail recursion is not optimized

See Also

• Defining functions
• Calling functions
• if/else

© 2026 elliktronic · Jaf Language