斐波那切数列递归算法

#include<stdio.h>
#include<stdlib.h>

int fibo(int a) {
	if (a == 0 || a == 1)
		return 1;
	else {
		return fibo(a - 1) + fibo(a - 2);
	}
}
int main() {
	int a;
	printf("请输入一个整数:\n");
	scanf_s("%d", &a);
	printf("%d的斐波那契数为:%d\n", a,fibo(a));

	for (int i = 0; i <= a; i++) {
		printf("%d的斐波那契数为:%d\n", i, fibo(i));
	}

	return 0;
}