In the context of the Fibonacci series, each subsequent number is the result of adding the two preceding numbers. For instance, the sequence begins with 0, 1, 1, 2, 3, 5, 8, 13, 21, and so forth. The initial two digits in the Fibonacci series are 0 and 1.
There are two methods to implement the Fibonacci series program:
- Generating Fibonacci Series without involving recursion
- Computing Fibonacci Series using recursion
Fibonaccci Series in C++ without Recursion
Let's explore a C++ program for generating the Fibonacci series without using recursion.
Example
Example
#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:
Output
Enter the number of elements: 10
0 1 1 2 3 5 8 13 21 34
Fibonnaci series using recursion in C++
Let's explore the Fibonacci sequence code in C++ utilizing recursion.
Example
Example
#include<iostream>
using namespace std;
void printFibonacci(int n){
static int n1=0, n2=1, n3;
if(n>0){
n3 = n1 + n2;
n1 = n2;
n2 = n3;
cout<<n3<<" ";
printFibonacci(n-1);
}
}
int main(){
int n;
cout<<"Enter the number of elements: ";
cin>>n;
cout<<"Fibonacci Series: ";
cout<<"0 "<<"1 ";
printFibonacci(n-2); //n-2 because 2 numbers are already printed
return 0;
}
Output:
Output
Enter the number of elements: 15
Fibonacci Series: 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377
