PazeE-Language/tests/fib.pe

// fib.pe — 递归斐波那契 + 迭代，验证函数调用、递归、算术、循环
int fib(int n)
{
    if (n < 2) return n;
    return fib(n - 1) + fib(n - 2);
}

int fib_iter(int n)
{
    int a = 0, b = 1;
    for (int i = 0; i < n; i++)
    {
        int t = a + b;
        a = b;
        b = t;
    }
    return a;
}

int main(void)
{
    int r = fib(10);
    printf("fib(10) = %d\n", r);
    printf("fib_iter(10) = %d\n", fib_iter(10));
    printf("fib(20) = %d\n", fib(20));
    return 0;
}