Re: [Haskell-cafe] Code and Perf. Data for Prime Finders (was: Genuine Eratosthenes sieve)

2007-02-22 Thread Joe Thornber
On 22/02/07, Melissa O'Neill [EMAIL PROTECTED] wrote: But talk is cheap. What about some actual numbers, and some code for some actual implementations...? Perhaps you could go the last 1% and upload a Primes package to Hackage and forever save us from inferior sieves ? (I enjoyed your paper

Re: [Haskell-cafe] Code and Perf. Data for Prime Finders (was: Genuine Eratosthenes sieve)

2007-02-22 Thread Bulat Ziganshin
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

Re: [Haskell-cafe] Code and Perf. Data for Prime Finders (was: Genuine Eratosthenes sieve)

2007-02-22 Thread ajb
G'day all. Quoting Melissa O'Neill [EMAIL PROTECTED]: But talk is cheap. What about some actual numbers, and some code for some actual implementations...? Just to fill out the implementations: http://andrew.bromage.org/darcs/numbertheory/ Math/Prime.hs has an implementation of the