Fibonacci using recursion program


#include
int fibo(int);
main()
{
int i,n,s,sum=0;
printf("\nEnter the limit : ");
scanf("%d",&n);
for(i=0;i{
s=fibo(i);
printf("%d\n",s);
}
//printf("%d",sum);
}
int fibo(int i)
{
if (i==0)
return (0);
if ((i==1)(i==2))
return (1);
else
return fibo(i-1)+fibo(i-2);
}

No comments: