Sieve of Eratosthenes
From APIDesign
(Difference between revisions)
JaroslavTulach (Talk | contribs)
(New page: The sieve of Eratohsthenes is an ancient, yet efficient, algorithm for producing prime numbers from interval 2-N for arbitrary N. I am using a vari...)
Next diff →
Current revision
The sieve of Eratohsthenes is an ancient, yet efficient, algorithm for producing prime numbers from interval 2-N for arbitrary N.
I am using a variant of this algorithm in my sieve project to measure Turing Speed of various languages and demonstrate that Truffle based languages on top of GraalVM are running at full (Turing) speed.
Follow
