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

Fixed a typo

Browse Source
This commit is contained in:
Rohit
2017-12-21 15:53:54 +05:30
parent 662d643069
commit 3e98018a26
1 changed files with 5 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
snippets/primes.md
View File

@ -1,15 +1,14 @@
### primes ### primes
It generates primes till a given number ```m It generates primes till a given number.
Explain briefly how the snippet works.
It works with the Sieve of Eratosthenes. It generate an array from 2 to the given number. Then it filters out the values (Using Array.filter()) divisible by any number from 2 to square root of the provided number.
```js ```js
const primes = num =>{ const primes = num => {
var arr = Array.from({length:num-1}).map((x,i)=> i+2); var arr = Array.from({length:num-1}).map((x,i)=> i+2);
var sqroot = Math.floor(Math.sqrt(num)); var sqroot = Math.floor(Math.sqrt(num));
var numsTillSqroot = Array.from({length:numb-1}).map((x,i)=> i+2); var numsTillSqroot = Array.from({length:sqroot-1}).map((x,i)=> i+2);
arra.forEach(x => arr = arr.filter(y => ((y%x)!==0)||(y== x))); numsTillSqroot.forEach(x => arr = arr.filter(y => ((y%x)!==0)||(y==x)));
return arr; return arr;
}// primes(10) -> [2,3,5,7] }// primes(10) -> [2,3,5,7]
``` ```