examples/spice/recursive-fibonacci.spice


1
2
3
4
5
6
7
8

f<int> fibo(int n) {
    if n <= 1 { return n; }
    return fibo(n - 1) + fibo(n - 2);
}

f<int> main() {
    printf("Result: %d", fibo(30));
}