Skip to content

Instantly share code, notes, and snippets.

@simon0191

simon0191/primes.js

Last active August 29, 2015 14:10
Show Gist options

  • Select an option

    Learn more about clone URLs
  • Save simon0191/e42a4d74f7e3343935ae to your computer and use it in GitHub Desktop.

Select an option

Learn more about clone URLs
Save simon0191/e42a4d74f7e3343935ae to your computer and use it in GitHub Desktop.
Download ZIP

Revisions

  1. simon0191 revised this gist Dec 6, 2014. 1 changed file with 3 additions and 6 deletions.
    9 changes: 3 additions & 6 deletions primes.js
    View file
    Original file line number Diff line number Diff line change
    @@ -3,19 +3,16 @@ var isPrime = {};
    function main(n) {
    for(var i = 0;i<=n;++i) isPrime[i] = true;
    isPrime[0] = isPrime[1] = false;
    var sol = [];
    for(var i = 2;i<=n;++i) {
    if(isPrime[i]) {
    sol.push(i);
    for(var j = i*i;j<=n;j+=i) {
    isPrime[j] = false;
    }
    }
    }

    var sol = [];
    for(var i = 2;i<=n;++i) {
    if(isPrime[i])sol.push(i);
    }
    return sol;
    };

    //console.log(main(1000));
    //console.log(main(200));
  2. simon0191 renamed this gist Dec 6, 2014. 1 changed file with 0 additions and 0 deletions.
    0 f.js → primes.js
    View file
    File renamed without changes.
  3. simon0191 created this gist Dec 6, 2014.
    21 changes: 21 additions & 0 deletions f.js
    View file
    Original file line number Diff line number Diff line change
    @@ -0,0 +1,21 @@
    var isPrime = {};

    function main(n) {
    for(var i = 0;i<=n;++i) isPrime[i] = true;
    isPrime[0] = isPrime[1] = false;
    for(var i = 2;i<=n;++i) {
    if(isPrime[i]) {
    for(var j = i*i;j<=n;j+=i) {
    isPrime[j] = false;
    }
    }
    }

    var sol = [];
    for(var i = 2;i<=n;++i) {
    if(isPrime[i])sol.push(i);
    }
    return sol;
    };

    //console.log(main(1000));