andre/30-seconds-of-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update and rename fibonacciTillNum.md to fibonacciUntilNum.md

Browse Source
This commit is contained in:
Angelos Chalaris
2017-12-23 12:11:31 +02:00
committed by GitHub
parent bcfb3fd0b2
commit e0f49dffa0
1 changed files with 7 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
snippets/fibonacciTillNum.md → snippets/fibonacciUntilNum.md
View File

@ -1,14 +1,15 @@
### fibonaciiTillNum ### fibonacciUntilNum
Generates an array, containing the Fibonacci sequence, up until the nth term. Generates an array, containing the Fibonacci sequence, up until the nth term.
Create an empty array of the specific length, initializing the first two values (`0` and `1`). Create an empty array of the specific length, initializing the first two values (`0` and `1`).
Use `Array.reduce()` to add values into the array, using the sum of the last two values, except for the first two. Use `Array.reduce()` to add values into the array, using the sum of the last two values, except for the first two.
Uses a mathematical formula to calculate the length of the array required Uses a mathematical formula to calculate the length of the array required.
```js ```js
const fibonacciTillNum = num => { const fibonacciUntilNum = num => {
let n = Math.ceil(Math.log(num * Math.sqrt(5) + 1/2) / Math.log((Math.sqrt(5)+1)/2))// fibonacci(5) -> [0,1,1,2,3]; let n = Math.ceil(Math.log(num * Math.sqrt(5) + 1/2) / Math.log((Math.sqrt(5)+1)/2));
return Array.from({ length: n}).reduce((acc, val, i) => acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i), []); return Array.from({ length: n}).reduce((acc, val, i) => acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i), []);
} }
// fibsTillNum(15) -> [0,1,1,2,3,5,8,13] // fibonacciUntilNum(15) -> [0,1,1,2,3,5,8,13]
``` ```