Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

fibonacci.cpp #208

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

fibonacci.cpp #208

wants to merge 1 commit into from

Conversation

Gaminee
Copy link

@Gaminee Gaminee commented Oct 30, 2020

A program to find fibonacci series.

A program to find fibonacci series.
@anuj840
Copy link

anuj840 commented Oct 1, 2021

Fibonacci Series in C++: In case of fibonacci series, next number is the sum of previous two numbers for example 0, 1, 1, 2, 3, 5, 8 etc. The first two numbers of fibonacci series are 0 and 1.

There are two ways to write the fibonacci series program:

Fibonacci Series without recursion
Fibonacci Series using recursion

Let's see the fibonacci series program in C++ without recursion.

#include <iostream>  
using namespace std;  
int main() {  
  int n1=0,n2=1,n3,i,number;    
 cout<<"Enter the number of elements: ";    
 cin>>number;    
 cout<<n1<<" "<<n2<<" "; //printing 0 and 1    
 for(i=2;i<number;++i) //loop starts from 2 because 0 and 1 are already printed    
 {    
  n3=n1+n2;    
  cout<<n3<<" ";    
  n1=n2;    
  n2=n3;    
 }    
   return 0;  
   }  

Output:

Enter the number of elements: 10
0 1 1 2 3 5 8 13 21 34

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants