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

Merge branch 'master' of https://github.com/kriadmin/30-seconds-of-code

Browse Source
This commit is contained in:
Rohit Tanwar
2017-12-22 22:46:00 +05:30
parent 74d043b867 099809caad
commit 7d5ca201ed
2 changed files with 6 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
snippets/fibonacciTillNum.md
View File

@ -10,5 +10,5 @@ const fibonacciTillNum = 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))// fibonacci(5) -> [0,1,1,2,3];
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] // fibsTillNum(15) -> [0,1,1,2,3,5,8,13]
``` ```

7
snippets/fibsTillNum.md
View File

@ -1,9 +1,10 @@
### fibsTillNum ### fibsTillNum
Returns the number of fibonnacci numbers till num(0 and num inclusive) Returns the number of fibonnacci numbers till num(0 and num inclusive).
```js ```js
const fibsTillNum = num => const fibsTillNum = num =>
Math.ceil(Math.log(num * Math.sqrt(5) + 1/2) / Math.log((Math.sqrt(5)+1)/2))// fibonacci(5) -> [0,1,1,2,3] Math.ceil(Math.log(num * Math.sqrt(5) + 1/2) / Math.log((Math.sqrt(5)+1)/2))
\\ fibsTillNum(10) -> 7 // fibonacci(5) -> [0,1,1,2,3]
// fibsTillNum(10) -> 7
``` ```