Spread the love

Write a c program to find Fibonacci series without and with recursion. Using the code below you can print as many numbers of terms of series as desired. Numbers of Fibonacci sequence are known as Fibonacci numbers. First few numbers of series are 0, 1, 1, 2, 3, 5, 8 etc, Except first two terms in sequence every other term is the sum of two previous terms, For example 8 = 3 + 5 (addition of 3, 5). This sequence has many applications in mathematics and Computer Science.

Fibonacci series in c using for loop

/* Fibonacci Series c language */
#include<stdio.h>
 
int main()
{
   int number,i;
   int first=0, second=1, next;
   
   
   printf("Enter the number of terms :");
   scanf("%d",&number);
   
   for(i=0; i<number ;i++)
   {
		if(i<=1)
		{
			next=i;
		}   	
		else
		{
	   		next=first+second;
			first=second;
			second=next;		
		}
		printf("%d\n",next);   	
   }
 
   return 0;
}

 

Output

 

Fibonacci with for loop

 

Fibonacci series program in c using recursion

 

#include<stdio.h>
 
int Fibonacci(int);
 
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) );
}

 

Output

Fibonacci with recursion