Domanda di colloquio di BookBub
Fibonacci sequence.
Risposta di colloquio
Anonimo
27 giu 2017
const MakeFibonacciRecursion = (n) => { if(n { if(n <= 2) { return 1; } let count = 2; let sumMinusOne = 1; let sumMinusTwo = 1; let temp, sum; //could also be done by eliminating count and doing n-- and when n==2, same distance while(count !== n) { sum = sumMinusOne + sumMinusTwo sumMinusTwo = sumMinusOne; sumMinusOne = sum; count++; } return sum; }