fibonacci best performance javascript
// A sequência começa com 0 e 1, depois, // os números subsequentes são compostos // pela soma dos dois números anteriores // da sequência. Daí: // (x - 2) + (x - 1) = próximo número da sequência function fibonacci(n) { const list = [0, 1]; for (let x = 2; x < n + 1; x += 1) { list.push(list[x - 2] + list[x - 1]); } return list[n]; } console.log(fibonacci(4));
js fibonacci sequence
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]); }
javascript fibonacci example
// 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; }
Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
