Sieve of Eratosthenes

From APIDesign

Revision as of 07:59, 9 March 2018 (edit) 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...) ← Previous diff

Current revision (07:59, 9 March 2018) (edit) (undo) 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...)

---

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.