Fibonacci series in C++ - Code with abuzar

 Fibonacci series in Easy method 

Fibonacci series :  In this case of Fibonacci series , next number is the sum of previous Two number , 0,1,2,3,5,8,13,21 etc. . The first two number of the Fibonacci series are 0 and 1 .

There are the two ways to write the Fibonacci series .

• Fibonacci series without Recursion 
• Fibonacci series using Recursion 

Fibonacci series in C++ without Recursion 

1. #include <iostream>  
2. using namespace std;  
3. int main() {  
4.   int n1=0,n2=1,n3,i,number;    
5.  cout<<"Enter the number of elements: ";    
6.  cin>>number;    
7.  cout<<n1<<" "<<n2<<" "; //printing 0 and 1    
8.  for(i=2;i<number;++i) //loop starts from 2 because 0 and 1 are already printed    
9.  {    
10.   n3=n1+n2;    
11.   cout<<n3<<" ";    
12.   n1=n2;    
13.   n2=n3;    
14.  }    
15.    return 0;  
16.    }  

Output 

Enter the Number of Elements : 10 

  0 1 1 2 3 5 8 13 21 34 

Please write comment if you find anything incorrect .

This article is contributed by Mohd Abuzar . if  you like code with abuzar and would like to contribute you can also write an article or mail at abuzar.abuzar.mohd325@gmail.com .