{"id":16194,"date":"2023-05-09T07:49:05","date_gmt":"2023-05-09T07:49:05","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=16194"},"modified":"2024-07-03T09:58:15","modified_gmt":"2024-07-03T09:58:15","slug":"c-program-to-print-fibonacci-series-up-to-n-numbers","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/c-program-to-print-fibonacci-series-up-to-n-numbers\/","title":{"rendered":"C Program to Print Fibonacci Series up to N Numbers"},"content":{"rendered":"

\"\"<\/p>\n

The Fibonacci sequence is named after the Italian mathematician Leonardo Fibonacci, who lived in the early thirteenth century. In this sequence, each number is the sum of the two preceding numbers. The sum of the first two elements in the sequence equals the next element.<\/p>\n

The first two numbers in the Fibonacci sequence must either be 1 and 1 or 0 and 1, depending on the chosen starting point, and each consecutive 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?<\/h3>\n
The following number in the Fibonacci sequence is determined by adding the two numbers before it. The numbers 0 and 1 are the first two of a Fibonacci sequence.<\/p>\n
The function gives a mathematical definition of the Fibonacci number series Fn.<\/p>\n
Fn=Fn-1 + Fn-2<\/code><\/pre>\n
Using the values of the first two terms,<\/p>\n
F0 = 0 and F1 = 1<\/code><\/pre>\n
The Fibonacci series begins as follows. <\/p>\n
0,1,1,2,3,5,8,13,21,........<\/code><\/pre>\n
In two ways Fibonacci series can be written –<\/strong><\/p>\n
    \n
  • Fibonacci series without recursion<\/li>\n
  • Fibonacci series using recursion<\/li>\n<\/ul>\n
    Method 1 of the Fibonacci Series Without Recursion ( Iterative Approach)<\/h3>\n
    Fibonacci sequences avoid using recursion and instead use two variables, f1, and f2, with starting values of 0 and 1, respectively, to represent the first and second components of the Fibonacci sequence.<\/p>\n
    Print 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