C++ Program to Display Fibonacci Series

Posted in C++ Tutorial

Updated on Oct 27, 2024

By Mari Selvan

👁️ 272 - Views

⏳ 4 mins

💬 1 Comment

Photo Credit to CodeToFun

🙋 Introduction

The Fibonacci series is a sequence of numbers in which each number is the sum of the two preceding ones, usually starting with 0 and 1.

This series has widespread applications in various fields, including mathematics and computer science.

In this tutorial, we'll explore a C++ program that generates and displays the Fibonacci series.

📄 Example

Let's delve into the C++ code that generates and displays the Fibonacci series.

displayFibonacci.cpp

Copied

#include <iostream>

// Function to display Fibonacci series up to n terms
void displayFibonacci(int n) {
  int first = 0, second = 1, next;

  std::cout << "Fibonacci series up to " << n << " terms: ";

  for (int i = 0; i < n; ++i) {
    std::cout << first << ", ";
    next = first + second;
    first = second;
    second = next;
  }

  std::cout << std::endl;
}

// Driver program
int main() {
  // Replace this value with the desired number of terms
  int terms = 10;

  // Call the function to display Fibonacci series
  displayFibonacci(terms);

  return 0;
}

💻 Testing the Program

To test the program with a different number of terms, simply replace the value of the terms variable in the main function.

Output

Fibonacci series up to 10 terms: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34,

Compile and run the program to see the Fibonacci series up to the desired number of terms.

🧠 How the Program Works

The program defines a function displayFibonacci that takes the number of terms (n) as input and prints the Fibonacci series up to n terms.
Inside the function, it initializes variables first and second with 0 and 1, respectively.
It then uses a loop to calculate and print the Fibonacci series up to the specified number of terms.
The loop updates the values of first and second in each iteration to generate the next Fibonacci number.

🧐 Understanding the Concept of Fibonacci Series

The Fibonacci series starts with 0 and 1. Each subsequent number in the series is the sum of the two preceding ones. The series begins as follows:

0, 1, 1, 2, 3, 5, 8, 13, 21, ...

🎢 Optimizing the Program

While the provided program is straightforward, consider exploring and implementing optimizations for larger Fibonacci series, such as using memoization techniques to avoid redundant calculations.

Feel free to incorporate and modify this code as needed for your specific use case. Happy coding!