// Benchmark: Recursive Fibonacci (measures call overhead)
// Tests: Function call performance, recursion overhead

fn fib(n: Int): Int =
    if n <= 1 then n
    else fib(n - 1) + fib(n - 2)

// Calculate fib(30) - about 1 million calls
let result = fib(30)
