Fibonacci (recursive)

# Self-authored for the EML case corpus (no external origin). Computes
# Fibonacci numbers via genuine double-call self-recursion
# (`fib(n) = fib(n-1) + fib(n-2)`) — a deliberate contrast with the corpus's
# existing examples/fibonacci-sequence/, which is iterative by design; a
# small N keeps the exponential call count fast.

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

for i in [0:10]:
    fib(i) => result
    "fib(" + str(i) + ") = " + str(result) => line
    line^0

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

for i in range(0, 11):
    result = fib(i)
    line = "fib(" + str(i) + ") = " + str(result)
    print(line)

fib(0) = 0
fib(1) = 1
fib(2) = 1
fib(3) = 2
fib(4) = 3
fib(5) = 5
fib(6) = 8
fib(7) = 13
fib(8) = 21
fib(9) = 34
fib(10) = 55

Trace event types