Skip to main content

FIBONACCI SERIES USING RECURSION

Fibonacci series using recursion
#include < stdio.h >
int Fibonacci(int);
main()
{
  int n, i = 0, c;
  printf("Enter the number of terms ");
  scanf("%d",&n);
  printf("First %d terms of Fibonacci series are :-\n", 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) );
  /*adding Fibonacci of (n-1) & (n-2) by recursive calling it*/
}
Labels:

Comments

Post a Comment

Popular posts from this blog

GREATEST OF 3 NUMBERS

Greatest of 3 numbers #include < stdio.h > void main() { int a,b,c; printf("enter any three numbers:\n"); scanf("%d%d%d",&a, &b, &c); if(a>b&&a>c) /*if a is greater than b & c*/ printf("greatest number is: %d",a); else if(b>c) /*if not a then if b is greater than c*/ printf("greatest number is: %d",b); else /*if a & b are not greater*/ printf("greatest number is: %d",c); }
Post a Comment
Read more

REVERSE NUMBER

Reverse number #include < stdio.h > int main() {   int n, reverse = 0;   printf("Enter a number to reverse\n");   scanf("%d",&n);   while (n != 0) {   reverse = reverse * 10;   reverse = reverse + n%10;   n = n/10; } /*taking unit place digit of no and moving to reverse Dividing the no to discard unit place digit*/   printf("Reverse of entered number is = %d\n", reverse);   return 0; }
Post a Comment
Read more

SWAPPING TWO NUMBERS

Swapping two numbers #include < stdio.h > int main() {   int x, y, temp;   printf("Enter the value of x and y\n");   scanf("%d%d", &x, &y);   printf("Before Swapping\nx = %d\ny = %d\n",x,y);   temp = x;   x = y;   y = temp; /*using temp to swap storing x to temp and y to x then moving temp to y*/   printf("After Swapping\nx = %d\ny = %d\n",x,y);   return 0; }
Post a Comment
Read more