tracker1 277 days ago. link 2 points ▲ ▼Avoid recursion in JS, it will end ugly... function fibonacci(n) { let nums = [0,1]; for (let i=1; i<n; i++) { nums = [nums[1], nums[0] + nums[1]]; } return nums[1]; }
Avoid recursion in JS, it will end ugly... function fibonacci(n) { let nums = [0,1]; for (let i=1; i<n; i++) { nums = [nums[1], nums[0] + nums[1]]; } return nums[1]; }