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

nth fibonacci number

Add Answer

Subodh Chandra Shil answered on March 1, 2022 Popularity 9/10 Helpfulness 2/10

answer nth fibonacci number

related nth fibonacci number

related find nth fibonacci number

nth fibonacci number

Comment

// Find N-th fibonacci number using recursion

#include <bits/stdc++.h>
using namespace std;

int fibo(int n)
{
    if (n == 1)
        return 1;
    if (n == 2)
        return 1;
    return fibo(n - 1) + fibo(n - 2);
}

int main()
{
    int n, T;
    cin >> T;
    while (T--)
    {
        cin >> n;
        cout << fibo(n) << endl;
    }

    return 0;
}

Popularity 9/10 Helpfulness 2/10 Language cpp

Source: Grepper

Tags: c++ fibonacci

Link to this answer
Share Copy Link

Contributed on May 31 2022

Subodh Chandra Shil

0 Answers Avg Quality 2/10

Closely Related Answers

nth fibonacci number

Comment

def fib(n):
    if(n<0):
        print("Invalid input")
    elif(n==0):
        return 0
    elif(n==1) or (n==2):
        return 1
    else:
        return fib(n-1)+fib(n-2)
n=int(input())
print(fib(n))

Popularity 9/10 Helpfulness 2/10 Language whatever

Source: Grepper

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Mar 01 2022

Red Team

0 Answers Avg Quality 2/10

nth fibonacci number

Comment

function nthFibonacci(n, cn = 0, val = 0, pval = 0) {
    if (n == cn) return pval;
    if (val == 0) val++;
    return nthFibonacci(n, cn + 1, val + pval, val);
}

Popularity 9/10 Helpfulness 2/10 Language javascript

Source: Grepper

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Jul 22 2022

Long Llama

0 Answers Avg Quality 2/10

find nth fibonacci number

Comment

// a dynamic programming approach for generating any number of fibonacci number
#include<bits/stdc++.h>
using namespace std;
 
long long int save[100]; // declare any sized array
long long int fibo(int n){
  if(n==0) return 0;
  if(n==1) return 1;
  if(save[n]!=-1) return save[n]; //if save[n] holds any value that means we have already calculated it and can return it to recursion tree
  save[n]=fibo(n-1)+fibo(n-2); // if it come tp this line that means I don't know what is the value of it
  return save[n];
}

int main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  memset(save,-1,sizeof save);
  cout<<fibo(2)<<'\n';

  return 0;
}

Popularity 9/10 Helpfulness 2/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Mar 15 2022

Lucky Lemur

0 Answers Avg Quality 2/10

nth fibonacci number

Contents

More Related Answers

nth fibonacci number

Closely Related Answers

nth fibonacci number

nth fibonacci number

find nth fibonacci number

Grepper

Documentation

Social

Legal

Contact

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