{"id":16149,"date":"2023-05-05T06:57:47","date_gmt":"2023-05-05T06:57:47","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=16149"},"modified":"2024-08-07T07:15:56","modified_gmt":"2024-08-07T07:15:56","slug":"cpp-program-to-print-fibonacci-series-up-to-n-numbers","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/cpp-program-to-print-fibonacci-series-up-to-n-numbers\/","title":{"rendered":"CPP Program to Print Fibonacci Series up to N Numbers"},"content":{"rendered":"

\"\"<\/p>\n

The Fibonacci series is a sequence of numbers where each number is the sum of the two preceding ones, usually starting with 0 and 1. This series is an important concept in mathematics and computer science due to its simple recursive nature and numerous applications in algorithms, data structures, and problem-solving. Writing a C++ program to print the Fibonacci series up to N numbers is a common exercise that helps in understanding loops, recursion, and efficient computation methods. This article provides an introduction to a C++ program for generating the Fibonacci series and discusses its implementation.<\/p>\n

According to the selected beginning point for the sequence, the first two numbers in the Fibonacci sequence must be either 1 and 1 or 0 and 1, and each succeeding number must be the sum of the two before it.<\/p>\n

What is Fibonacci Series?<\/h2>\n

Any number in the series can be calculated as the direct sum of the two numbers before it.<\/p>\n

Following is Fibonacci Series –<\/p>\n

0, 1, 1, 2, 3, 5, 8, 13, 21<\/code><\/pre>\n
How does the Fibonacci Sequence Function Work?<\/h2>\n
The sum of the two numbers preceding it determines the next number in the Fibonacci sequence. A Fibonacci sequence starts with the digits 0 and 1. <\/p>\n
    \n
  • \n
    The function defines the Fibonacci number sequence Fn in mathematical terms. <\/p>\n
    Fn=Fn-1 + Fn-2<\/strong><\/p>\n<\/li>\n
  • \n
    Using the values of the first two terms,<\/p>\n
    F0 = 0 and F1 = 1<\/strong><\/p>\n<\/li>\n
  • \n
    The Fibonacci series begins as follows.<\/p>\n
    0,1,1,2,3,5,8,13,21,……..<\/strong><\/p>\n<\/li>\n<\/ul>\n
    Methods to Write Fibonacci Series<\/h2>\n
    Fibonacci series can be written in two ways –<\/p>\n
      \n
    • Fibonacci series without recursion<\/li>\n
    • Fibonacci series using recursion<\/li>\n<\/ul>\n
      Method 1 to Implement Fibonacci Series without Recursion ( Iterative Approach)<\/h3>\n
      Without recursion, Fibonacci sequences use two variables, f1, and f2, and initialize them with 0 and 1 correspondingly as those values correspond to the first and second components of the Fibonacci sequence.
      \nPrint f2 after iterating from 1 to n-1, then save it in a temporary variable and update f2 with f2 + f1 and f1 as f2.<\/p>\n
      Code Implementation<\/strong><\/p>\n\t\t\t\t\t\t