Answers for "fibbanacci sequence"

5

fibonacii sequence code

# Program to display the Fibonacci sequence up to n-th term

nterms = int(input("How many terms? "))

# first two terms
n1, n2 = 0, 1
count = 0

# check if the number of terms is valid
if nterms <= 0:
   print("Please enter a positive integer")
elif nterms == 1:
   print("Fibonacci sequence upto",nterms,":")
   print(n1)
else:
   print("Fibonacci sequence:")
   while count < nterms:
       print(n1)
       nth = n1 + n2
       # update values
       n1 = n2
       n2 = nth
       count += 1
Posted by: Guest on May-12-2020
20

fibonacci sequence

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ...
Posted by: Guest on December-16-2020
8

fibonacci sequence

def fibonacci(n):
    if n <= 0:
        return 0
    elif n == 1:
        return 1
    else:
        return fibonacci(n-1) + fibonacci(n-2)
Posted by: Guest on January-03-2021
0

fibbanacci sequence

//x is the index number in the fibonnacci sequence. 
//The function will return that index's fibonacci value
function fib(x) {
    let a = 0;
    let b = 1;
    for (var i = 0; i < x-1; i++) {
        let c = b;
        b += a;
        a = c;
    }
    return b;
}
Posted by: Guest on August-24-2021
0

fibonacci sequence

// Copy paste code here https://play.golang.org/
package main 

import "fmt"

func fibo(n int) int {
	x, y := 0, 1
	for i := 0; i < n; i++ {
		x, y = y, x+y
	}
	return x
}

func main() { fmt.Println(fibo(5)) } // return 5
Posted by: Guest on July-22-2021
1

fibonacci sequence

int n ; 
double feb  = (1/Math.pow(5,0.5)) * (Math.pow((1+Math.pow(5,0.5))/2,n)) - (1/Math.pow(5,0.5))* (Math.pow((1-Math.pow(5,0.5))/2,n));
Posted by: Guest on August-01-2021

Code answers related to "Javascript"

Browse Popular Code Answers by Language