let fibo = [0, 1]
for (var i = 2; i <= 10; i++) {
fibo[i] = fibo[i - 1] + fibo[i - 2];
}
console.log(fibo)
//Output: [ 0, 1, 1, 2, 3,5, 8, 13, 21, 34, 55]/**
* Method that calculates the Fibonacci Sequence and returns the n'th value of the sequence
* @param {*} pos
*/
const getFibPosition = (pos) => {
if (pos === 0) return null;
if (pos === 1) return 0;
if (pos === 2) return 1;
let fibArray = [0, 1];
let aux1, aux2;
for (let i = 2; i < pos; i++) {
aux1 = fibArray[i - 1];
aux2 = fibArray[i - 2];
fibArray.push(aux1 + aux2);
}
return fibArray[pos - 1];
}var i;
var fib = []; // Initialize array!
fib[0] = 0;
fib[1] = 1;
for (i = 2; i <= 10; i++) {
// Next fibonacci number = previous + one before previous
// Translated to JavaScript:
fib[i] = fib[i - 2] + fib[i - 1];
console.log(fib[i]);
}// number fibonnaci to array format
function fibonacci(nums) {
let fib = [0, 1];
let data = [];
for(let i = 2; i <= nums; i++) {
fib[i] = fib[i - 1] + fib[i - 2];
data.push(fib[i]);
}
return data;
}function fibonacciRecursive(n) {
if (n < 2) {
return n
}
return fibonacciRecursive(n - 1) + fibonacciRecursive(n - 2)
}
fibonacciRecursive(8);
// 21function getFibonacci(n) {
let a = 1;
let b = 1;
for (let i = 3; i <= n; i++) {
let c = a + b;
a = b;
b = c;
}
return b;
}
console.log(getFibonacci(3)); // => 2
console.log(getFibonacci(7)); // => 13
console.log(getFibonacci(20)); // => 6765
console.log(getFibonacci(77)); // => 5527939700884757