写一个递归求斐波那契数列的函数,并输出前24项
#include <stdio.h>
unsigned long long fibonacci(int n) {
if (n <= 1) {
return n;
} else {
return fibonacci(n - 1) + fibonacci(n - 2);
}
}
int main() {
int i;
for (i = 0; i < 24; i++) {
unsigned long long fib = fibonacci(i);
printf("斐波那契数列第%d项:%llu\n", i + 1, fib);
}
return 0;
}