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

Fibonacci Sequence

Add Answer

baguette answered on December 16, 2020 Popularity 10/10 Helpfulness 2/10

answer Fibonacci Sequence

related fibonacci sequence

related the fibonacci sequence

related fibonacci sequence code

related Fibonacci sequence

related Fibonacci Sequence

Fibonacci Sequence

Comment

nterms = int(input())

x, y, z = 1, 1, 0

if nterms == 1:
   print(x)
else:
   while z < nterms:
       print(x, end=" ")
       nth = x + y
       x = y
       y = nth
       z += 1

Popularity 10/10 Helpfulness 2/10 Language python

Source: Grepper

Tags: fibonacci python sequence

Link to this answer
Share Copy Link

Contributed on Oct 25 2022

baguette

0 Answers Avg Quality 2/10

Closely Related Answers

fibonacci sequence

Comment

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ...

Popularity 10/10 Helpfulness 3/10 Language whatever

Source: www.mathsisfun.com

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Dec 16 2020

Marton

0 Answers Avg Quality 2/10

fibonacci sequence

Comment

function _fib(number) {
    if (number === 0 || number === 1) {
        return number;
    } else {
        return _fib(number - 1) + _fib(number - 2)
    }
}

Popularity 10/10 Helpfulness 3/10 Language javascript

Source: Grepper

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Dec 27 2021

Hassan Hamdan

0 Answers Avg Quality 2/10

the fibonacci sequence

Comment

int fabseq(int nth){
        if (nth == 1 || nth == 2){
            return 1;
        }
        int equ = (1/sqrt(5))*pow(((1+sqrt(5))/2), nth)-(1/sqrt(5))*pow((1-sqrt(5))/2, nth);
        return equ;
}

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: Grepper

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Oct 04 2022

Red Team

0 Answers Avg Quality 2/10

fibonacci sequence code

Comment

Language: Rust (not supported by grepper)

fn fibcalculate(x:i32) -> i32 {
    let mut two_nums_ago = 0;
    let mut current_num = 1;
    let mut last_num = 0;
    for i in 1..x {                   // or 0..x if you start fibonacci from 0, although that breaks the math law as 0+0 != 1
        last_num = current_num;
        current_num += two_nums_ago;
        two_nums_ago = last_num;
    }
    return current_num;
}

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: Grepper

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Dec 22 2022

Wrong Walrus

0 Answers Avg Quality 2/10

Fibonacci sequence

Comments(1)

function myFib(n) {
    if (isNaN(n) || Math.floor(n) !== n)
        return "Not an integer value!";
    if (n === 0 || n === 1)
        return 3;
    else
        return myFib(n - 1) + myFib(n - 2);
}

console.log(myFib(5));

Popularity 10/10 Helpfulness 2/10 Language javascript

Source: www.homeworklib.com

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Aug 17 2021

Talented Tarsier

0 Answers Avg Quality 2/10

Fibonacci Sequence

Comment

// 定義一個計算 Fibonacci Sequence 的函式
function fibonacci(n) {
  if (n <= 1) {
    return n; // 基本情況: 當 n 為 0 或 1 時，返回 n
  } else {
    // 否則，遞迴計算前兩個數字的和
    return fibonacci(n - 1) + fibonacci(n - 2);
  }
}

// 創建一個函式來展示 Fibonacci Sequence
function displayFibonacciSequence(n) {
  for (let i = 0; i < n; i++) {
    console.log(fibonacci(i));
  }
}

// 使用示例：顯示前 10 個 Fibonacci 數字
displayFibonacciSequence(10);

Popularity 9/10 Helpfulness 2/10 Language javascript

Source: chat.openai.com

Tags: fibonacci fibo

Link to this answer
Share Copy Link

Contributed on Oct 31 2023

Unsightly Unicorn

0 Answers Avg Quality 2/10

Fibonacci Sequence

Contents

More Related Answers

Fibonacci Sequence

Closely Related Answers

fibonacci sequence

fibonacci sequence

the fibonacci sequence

fibonacci sequence code

Fibonacci sequence

Fibonacci Sequence

Grepper

Documentation

Social

Legal

Contact

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