Using recursion, generate 'n' terms of fibonacci series (n > 0)

Advertisement
Q- Using recursion, generate 'n' terms of  fibonacci series (n > 0) 

Ans. #include<stdio.h>
int Fibonacci(int);
main()
{
   int n, i = 0, c;
  scanf("%d",&n);
  printf("Fibonacci series\n");
 for ( c = 1 ; c <= n ; c++ )
   {
    printf("%d\n", Fibonacci(i));
      i++;
   }
   return 0;
}
int Fibonacci(int n)
{
   if ( n == 0 )
      return 0;
   else if ( n == 1 )
      return 1;
   else
      return ( Fibonacci(n-1) + Fibonacci(n-2) );

Advertisement
Previous
Next Post »
Thanks for your comment