num = 1
num1 = 0
num2 = 1
import time
for i in range(0, 10):
print(num)
num = num1 + num2
num1 = num2
num2 = num
time.sleep(1)
// Fibonacci generator
function* fibonacci() {
var a = 0;
var b = 1;
while (true) {
yield a;
a = b;
b = a + b;
}
}
// Instantiates the fibonacci generator
fib = fibonacci();
// gets first 10 numbers from the Fibonacci generator starting from 0
for (let i = 0; i < 10; i++) {
console.log(i + ' => ' + fib.next().value);
}# 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 sequencefunction 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));
//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;
}
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));