Files
30-seconds-of-code/snippets/primes.md
2017-12-27 17:05:21 +02:00

20 lines
606 B
Markdown

### primes
Generates primes up to a given number, using the Sieve of Eratosthenes.
Generate an array from `2` to the given number. Use `Array.filter()` to filter out the values divisible by any number from `2` to the square root of the provided number.
```js
const primes = num => {
let arr = Array.from({length: num - 1}).map((x, i) => i + 2),
sqroot = Math.floor(Math.sqrt(num)),
numsTillSqroot = Array.from({length: sqroot - 1}).map((x, i) => i + 2);
numsTillSqroot.forEach(x => arr = arr.filter(y => ((y % x) !== 0) || (y == x)));
return arr;
};
```
```js
primes(10) // [2,3,5,7]
```