Build README

This commit is contained in:
Angelos Chalaris
2017-12-12 11:54:19 +02:00
parent 0fe175fadb
commit 5f67fb2b24
2 changed files with 7 additions and 11 deletions

View File

@ -146,11 +146,12 @@ var isEven = num => Math.abs(num) % 2 === 0;
### Factorial ### Factorial
Create an array of length `n+1`, use `reduce()` to get the product of every value in the given range, utilizing the index of each element. Use recursion.
If `n` is less than or equal to `1`, return `1`.
Otherwise, return the product of `n` and the factorial of `n - 1`.
```js ```js
var factorial = n => const factorial = n => n <= 1 ? 1 : n * factorial(n - 1)
Array.apply(null, [1].concat(Array(n))).reduce( (a, _, i) => a * i || 1 , 1);
``` ```
### Fibonacci array generator ### Fibonacci array generator

View File

@ -1,14 +1,9 @@
### Factorial ### Factorial
Use recursion. If `n` is less than (for safety) or equal to `1`, return `1`. Otherwise, return the product of `n` and the factorial of `n - 1`. Use recursion.
If `n` is less than or equal to `1`, return `1`.
Otherwise, return the product of `n` and the factorial of `n - 1`.
```js ```js
const factorial = n => n <= 1 ? 1 : n * factorial(n - 1) const factorial = n => n <= 1 ? 1 : n * factorial(n - 1)
``` ```
Another way: create an array of length `n+1`, use `reduce()` to get the product of every value in the given range, utilizing the index of each element.
```js
var factorial = n =>
Array.apply(null, [1].concat(Array(n))).reduce( (a, _, i) => a * i || 1 , 1);
```