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

Fibonacci

Add Answer

Mackerel answered on January 1, 2021 Popularity 9/10 Helpfulness 1/10

answer Fibonacci

related fibbonacci

related fibonacci

related Fibonacci , fibo

related fibonacci

related Fibonacci

related fibonacci

Fibonacci

Comment

# Fibonacci in Python

# Functional programming
from functools import reduce
 
fib1 = lambda n: reduce(lambda x, _: x+[x[-1]+x[-2]],
                                 range(n-2), [0, 1])
 
print(fib1(5))

# Iterative
def Fibonacci(n):
    f0, f1 = 0, 1
    for _ in range(n):
        yield f0
        f0, f1 = f1, f0+f1

fib2 = list(Fibonacci(5))
print(fib2)

Popularity 9/10 Helpfulness 1/10 Language python

Source: Grepper

Tags: fibonacci python

Link to this answer
Share Copy Link

Contributed on May 17 2023

Mackerel

0 Answers Avg Quality 2/10

Closely Related Answers

fibbonacci

Comment

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811,

Popularity 10/10 Helpfulness 4/10 Language whatever

Source: google.com

Tags: whatever whateve

Link to this answer
Share Copy Link

Contributed on Feb 01 2021

Joyous Jaguar

0 Answers Avg Quality 2/10

fibonacci

Comment

# Easy fibonacci exercise
# Method #1
def fibonacci(n):
    # 1th: 0
    # 2th: 1
    # 3th: 1 ...
    if n == 1:
        return 0
    elif n == 2:
        return 1
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)

# Method #2
def fibonacci2(n):
    if n == 0: return 0
    n1 = 1
    n2 = 1
    # (1, n - 2) because start by 1, 2, 3... not 0, 1, 1, 2, 3....
    for i in range(1, n - 2):
        n1 += n2
        n2 = n1 - n2
    return n1


print(fibonacci(13))
# return the nth element in the fibonacci sequence

Popularity 10/10 Helpfulness 4/10 Language python

Source: Grepper

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Jan 01 2021

Solo developer

0 Answers Avg Quality 2/10

fibonacci

Comment

def fibonacci(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    return fibonacci(n - 1) + fibonacci(n - 2)

Popularity 10/10 Helpfulness 3/10 Language whatever

Source: dbader.org

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Oct 16 2021

Shy Shrike

0 Answers Avg Quality 2/10

fibonacci

Comment

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

limit = int(input("Insert the number of the values of the series that you would see: "))

for num in range(1, limit+1):
    print(fibonacci(num))

Popularity 10/10 Helpfulness 2/10 Language python

Source: www.programmareinpython.it

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Dec 01 2021

Obnoxious Opossum

0 Answers Avg Quality 2/10

Fibonacci , fibo

Comment

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

Popularity 10/10 Helpfulness 2/10 Language javascript

Source: medium.com

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Sep 11 2021

Clever Cheetah

0 Answers Avg Quality 2/10

fibonacci

Comment

#include <iostream>

using namespace std;

int fibonacci(int n) {
    int fib1 = 0;  // fib(1)
    int fib2 = 1;  // fib(2)
    int fib = 0;   // To store the Fibonacci number

    for (int i = 3; i <= n; ++i) {
        fib = fib1 + fib2;
        fib1 = fib2;
        fib2 = fib;
    }

    return fib;
}

int main() {
    int n;
    cin >> n;  // Read the input

    // Calculate and print the Fibonacci number of N
    cout << fibonacci(n) << endl;

    return 0;
}

Popularity 9/10 Helpfulness 2/10 Language cpp

Source: chat.openai.com

Tags: c++

Link to this answer
Share Copy Link

Contributed on Jun 22 2023

red-kid

0 Answers Avg Quality 2/10

Fibonacci

Comment

fib=lambda x: x if x<=1 else fib(x-1) + fib(x-2)

Popularity 10/10 Helpfulness 1/10 Language python

Source: dev.to

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Sep 30 2022

David K.

0 Answers Avg Quality 2/10

Fibonacci

Comment

public static long Fibonacci(long n) {
    if (n <= 1) {
        return n;
    }

    long a = 0;
    long b = 1;
    long c = 0;

    if (n >= 2) {
        a = Fibonacci(n - 1); // Recursive call to calculate Fibonacci(n-1)
        b = Fibonacci(n - 2); // Recursive call to calculate Fibonacci(n-2)
        c = a + b; // Calculate the current Fibonacci number
    }

    return c;
}

Popularity 9/10 Helpfulness 1/10 Language css

Source: chat.openai.com

Tags: css fibonacci

Link to this answer
Share Copy Link

Contributed on Jun 16 2023

Abdul Aziz

0 Answers Avg Quality 2/10

fibonacci

Comment

import gmpy2
from gmpy2 import mpz

def gmp_fib(n):
    a, b = power(mpz(1), mpz(0), mpz(n))
    return a

Popularity 8/10 Helpfulness 1/10 Language whatever

Source: www.oranlooney.com

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Jan 22 2024

Steve T

0 Answers Avg Quality 2/10

Fibonacci

Contents

More Related Answers

Fibonacci

Closely Related Answers

fibbonacci

fibonacci

fibonacci

fibonacci

Fibonacci , fibo

fibonacci

Fibonacci

Fibonacci

fibonacci

Grepper

Documentation

Social

Legal

Contact

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