Breaking News: Grepper is joining You.com. Read the official announcement!

Find the Fibonacci series of N terms.

Mahdi Asif answered on June 18, 2022 Popularity 3/10 Helpfulness 1/10

answer Find the Fibonacci series of N terms.

Find the Fibonacci series of N terms.

Comment

#include <iostream>
#include <conio.h>
using namespace std;
int main()
{
    int n,f=0,f1=0,f2=1;

    cout << "ENTER THE NUMBER: ";
    cin >> n;
    cout << "Fibonacci Series: ";

    for(int i=1;i<=n;i++)
    {
        if(i==1)
        {
            cout << f1 << ",";continue;
        }
        if(i==2)
        {
            cout << f2 << ",";continue;
        }
        f=f1+f2;
        f1=f2;
        f2=f;

        cout << f << ",";
    }
    getch();
}

Popularity 3/10 Helpfulness 1/10 Language whatever

Source: Grepper

Tags: fibonacci find n series whatever

Link to this answer
Share Copy Link

Contributed on Jun 18 2022

Mahdi Asif

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

Find the Fibonacci series of N terms.

Contents

More Related Answers

Find the Fibonacci series of N terms.

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.