Fibonacci series in C/C++

What is Fibonacci series?

1. 

   
   

   
   
2. A series which is defined as

    each number is the sum of the two preceding numbers.
3. In simple words, this means that the upcoming number is the sum of the previous two numbers. For example, the following is the Fibonacci series 0, 1, 1, 2, 3, 5, 8, 13, 21, 34,...etc.

There are two ways to write the Fibonacci series program: 

• Fibonacci Series without recursion 
• Fibonacci Series using recursion

1. 
   

2.  Fibonacci Series without recursion in C

3. 
   

#include<stdio.h> 
#include<conio.h>       
void main()    
{    
 int n1=0,n2=1,n3,i,number;    
 printf("Enter the number of elements:");    
 scanf("%d",&number);    
 printf("\n%d %d",n1,n2);    
 for(i=2;i<number;++i)
 {    
  n3=n1+n2;    
  printf(" %d",n3);    
  n1=n2;    
  n2=n3;    
 }  
  getch();  
 }    
 

Fibonacci Series using recursion in C

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