[Haskell-cafe] Re: Code and Perf. Data for Prime Finders

oleg at pobox.com oleg at pobox.com
Sat Feb 24 02:03:09 EST 2007

Perhaps you might want include in your test the following:


It seems quite close to the genuine Eratosthenes sieve algorithm: it
employs the idea of marks, it can cross composite numbers off several
times, and it never tries to divide or examine prime numbers. In fact,
the algorithm doesn't even use the full division or full comparison
(let alone other arithmetic operations).

More information about the Haskell-Cafe mailing list