
- C++ Basics
- C++ Home
- C++ Overview
- C++ Environment Setup
- C++ Basic Syntax
- C++ Comments
- C++ Data Types
- C++ Variable Types
- C++ Variable Scope
- C++ Constants/Literals
- C++ Modifier Types
- C++ Storage Classes
- C++ Operators
- C++ Loop Types
- C++ Decision Making
- C++ Functions
- C++ Numbers
- C++ Arrays
- C++ Strings
- C++ Pointers
- C++ References
- C++ Date & Time
- C++ Basic Input/Output
- C++ Data Structures
- C++ Object Oriented
- C++ Classes & Objects
- C++ Inheritance
- C++ Overloading
- C++ Polymorphism
- C++ Abstraction
- C++ Encapsulation
- C++ Interfaces
C++ Program to Find Fibonacci Numbers using Recursion
The following is an example of fibonacci series using recursion.
Example
#include <iostream> using namespace std; int fib(int x) { if((x==1)||(x==0)) { return(x); }else { return(fib(x-1)+fib(x-2)); } } int main() { int x , i=0; cout << "Enter the number of terms of series : "; cin >> x; cout << "\nFibonnaci Series : "; while(i < x) { cout << " " << fib(i); i++; } return 0; }
Output
Enter the number of terms of series : 15 Fibonnaci Series : 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377
In the above program, the actual code is present in the function ‘fib’ as follows −
if((x==1)||(x==0)) { return(x); }else { return(fib(x-1)+fib(x-2)); }
In the main() function, a number of terms are entered by the user and fib() is called. The fibonacci series is printed as follows.
cout << "Enter the number of terms of series : "; cin >> x; cout << "\nFibonnaci Series : "; while(i < x) { cout << " " << fib(i); i++; }
- Related Articles
- C++ Program to Find Fibonacci Numbers using Iteration
- Python Program to Find the Fibonacci Series Using Recursion
- C++ Program to Find Fibonacci Numbers using Dynamic Programming
- C++ Program to Find Fibonacci Numbers using Matrix Exponentiation
- Python Program to Find the Fibonacci Series without Using Recursion
- Python Program to Display Fibonacci Sequence Using Recursion
- C++ program to Find Sum of Natural Numbers using Recursion
- Fibonacci series program in Java using recursion.
- C++ Program to Find the Product of Two Numbers Using Recursion
- Fibonacci series program in Java without using recursion.
- C++ Program to Find G.C.D Using Recursion
- Java Program to Find Sum of N Numbers Using Recursion
- Haskell Program to Find Sum of N Numbers Using Recursion
- Python Program to Find the Product of two Numbers Using Recursion
- Java Program to Find the Sum of Natural Numbers using Recursion

Advertisements