[Haskell-cafe] Code and Perf. Data for Prime Finders (was:
Genuine Eratosthenes sieve)
Bulat Ziganshin
bulat.ziganshin at gmail.com
Thu Feb 22 15:42:12 EST 2007
Hello Melissa,
Thursday, February 22, 2007, 9:54:38 AM, you wrote:
> - O'Neill (#1) is the algorithm of mine discussed in http://
> www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf
but how it looks compared with classic C implementation of sieve algorithm?
--
Best regards,
Bulat mailto:Bulat.Ziganshin at gmail.com
More information about the Haskell-Cafe
mailing list