5-2编写递归函数求Fibonacci数列的第n项

fib(0)=1

fib(1)=1

fib(n)=fib(n-1)+fib(n-2)

#include<stdio.h>
int fibonacci(int n);
int main(void)
{
	int n;
	scanf("%d",&n);
	printf("%d",fibonacci(n-1));
	return 0;
}
int fibonacci(int n)
{
	int tmp;
	if(n==0||n==1)
		tmp=1;
	else
		tmp=fibonacci(n-1)+fibonacci(n-2);
	return tmp;
}