Skip to main content

Fibonacci series in c++ : What is the Fibonacci algorithm?

  • Fibonacci Algorithm


  • The Fibonacci series is a sequence of numbers in the following order: The numbers in this series are going to start with 0 and 1. The next number is the sum of the previous two numbers. The formula for calculating the Fibonacci Series is as follows: T(n) = T (n-1) + T(n-2) where: T(n) is the term number.
0,1,1,2,3,5,8,13,21,and so on

Fibonacci series example. 

Code for fibonacci series in c++:

#include <iostream>

using namespace std;

void fib(int n){ 

 //void function

    int t1=0; //term 1

    int t2=1; //term 2

    int nextterm;

    for(int i=1;i<=n;i++){

        cout<<t1<<" ";

        nextterm=t1+t2;

        t1=t2;

        t2=nextterm;

        }

}

int main() {

    int n;

    cin>>n; //input n

    fib(n);  //function call

    return 0;

}



Instagram 👇 

For more Queries

Labels:

Comments

Post a Comment

Popular posts from this blog

Loops in C++ : What is loop and types of loop in C++?

 Loops In computer programming, loops are used to   repeat a block of code  . For example, let's say we want to show a message 1000times , Then instead of writing the print statement 1000 times, we can use a loop. Type of loops 1. For loop 2. While loop 3. Do while loop For loop  For loop uses an external variable to control the execution. A for loop takes into account the                                           Initialization Condition checking Incrementation In its syntax itself. The syntax is shown below:- For(initialization;condition;incrememt){ //body } While loop  Imagine we had to print “Hello World” 100 times or n-number of times. Would it be wise to write cout << “Hello World\n” 100  times. While loops help us automate this. Sometimes, the loop also uses an external initialization and incrementation logic to control how many times t...
1 comment
Read more

Time and Space complexity : What does time and space complexity mean?

 Time and Space complexity                                  Time Complexity Time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of the input. Types of notations 1. O-notation: It is used to denote asymptotic upper bound. For a given function g(n), we denote it by O(g(n)). Pronounced as “big-oh of g of n”. It also known as worst case time complexity as it denotes the upper bound in which algorithm terminates. 2. Ω-notation: It is used to denote asymptotic lower bound. For a given function g(n), we denote it by Ω(g(n)). Pronounced as “big-omega of g of n”. It also known as best case time complexity as it denotes the lower bound in which algorithm terminates. 3. !-notation: It is used to denote the average time of a program. Comparison of functions on the basis of time complexity It follows the following order in case of time complexit...
1 comment
Read more