Open Gaminee opened 3 years ago
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
A program to find fibonacci series.