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

fibonacci recursion

Add Answer

Mysterious Macaque answered on July 15, 2021 Popularity 10/10 Helpfulness 3/10

answer fibonacci recursion

related fibonacci series using recursion

related fibonacci using recursion

related fibonacci series using recursion

related recursive fibonacci

related fibonacci series using recursion

related Fibonacci without recursion

fibonacci recursion

Comment

function fib(n) {
    if (n === 1 || n === 0)
        return n

    return fib(n - 1) + fib(n - 2)
}
console.log('fib:', fib(9))		// [Log]: fib: 34

/*
    Time complexity O(2^n)
    Space complexity O(n)
    Since fib(n-1) gets evaluated completely before fib(n-2), 
    there will never be more than n levels of recursion.
*/

Popularity 10/10 Helpfulness 3/10 Language javascript

Source: Grepper

Tags: fibonacci javascript recursion

Link to this answer
Share Copy Link

Contributed on Jun 30 2022

Mysterious Macaque

0 Answers Avg Quality 2/10

Closely Related Answers

fibonacci series using recursion

Comment

def fib (n):
  if n == 0 or n ==1:
      return n  
  else:
        return fib(n-2) + fib(n-1)
#n = int(input("please enter a number  "))

n=10
for index,num in enumerate(range(n+1)):
     print(f"F{index} :", fib(num))

Popularity 10/10 Helpfulness 4/10 Language python

Source: onecompiler.com

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Dec 29 2021

Bloody Bat

0 Answers Avg Quality 2/10

fibonacci using recursion

Comment

int fib (int n) {
        if (n < 2)
            return 1;
        return fib(n-1) + fib(n-2);
    }

Popularity 10/10 Helpfulness 4/10 Language whatever

Source: www.hackerearth.com

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Mar 25 2022

Itchy Iguana

0 Answers Avg Quality 2/10

fibonacci series using recursion

Comment

def fibonacci(n):
    if n <= 1:
          return n
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)

n = int(input())
result = fibonacci(n)
print(result)

Popularity 9/10 Helpfulness 3/10 Language python

Source: learning.ccbp.in

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Aug 26 2022

Vijay Potnuru

0 Answers Avg Quality 2/10

recursive fibonacci

Comment

    def fibo2(n):
        if n ==1 or n==0:
            return 1
        else :
            n = n+fibo2(n-1) 
            return n 
    print(fibo2(n1))

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: Grepper

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Jul 15 2021

kirito.

0 Answers Avg Quality 2/10

fibonacci series using recursion

Comment

// Fibonacci serise using time complexity of O(n)=n or optimal time complexity
#include <iostream>
using namespace std;

int fArr[10];

int Fibo(int n){
    if(n <= 1){ //base class. Setting the first 2 index value to 0 &1
        fArr[n] = n;
        return n;
    }else{
        if(fArr[n-2] == -1){//if no values in the array then by default -1 will be there as default value
            fArr[n-2] = Fibo(n-2); // making a recursive call if the value doesn't present in the array
        }
        if(fArr[n-1] == -1){
            fArr[n-1] = Fibo(n-1);
        }
        return fArr[n-2] + fArr[n-1];
    }
}

int main() {
    int term;
    cout << "Enter Your Fibonacci Term No: " << endl;
    cin >> term;
    for(int i=0; i<term; i++){ //making every index value of -1
        fArr[i]=-1;
    }
    cout << "The Result Of Fibonacci Serise is: " << Fibo(term) << endl;

    return 0;
}

Popularity 8/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: c++ fibonacci fi

Link to this answer
Share Copy Link

Contributed on Feb 06 2023

isuro

0 Answers Avg Quality 2/10

Fibonacci without recursion

Comment

# Non-recursive solution
def fibonacci2(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else:
        # Initialize the first two Fibonacci numbers
        a, b = 0, 1
        # Loop from 2 to n
        for _ in range(2, n + 1):
            # Compute the next Fibonacci number
            a, b = b, a + b
        return b

# Test the function
print(fibonacci2(5))

Popularity 6/10 Helpfulness 1/10 Language python

Source: chat.openai.com

Tags: fibonacci python recursion rec

Link to this answer
Share Copy Link

Contributed on Sep 07 2023

Ben Akram

0 Answers Avg Quality 2/10

fibonacci recursion

Contents

More Related Answers

fibonacci recursion

Closely Related Answers

fibonacci series using recursion

fibonacci using recursion

fibonacci series using recursion

recursive fibonacci

fibonacci series using recursion

Fibonacci without recursion

Grepper

Documentation

Social

Legal

Contact

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