CompilerSysY/testcases/functional_test/51_recursion_test2.sy
2023-05-08 21:15:52 +08:00

17 lines
188 B
Plaintext

int fib(int n) {
if (n == 0)
return 0;
if (n == 1)
return 1;
int p;
p = n - 1;
int q;
q = n - 2;
return fib(p) + fib(q);
}
int main() {
int tmp;
tmp = 10;
return fib(tmp);
}