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

Donald Bruce Stewart dons at cse.unsw.edu.au
Sun Feb 25 03:36:00 EST 2007

> Someone asked if I'd include a "classic C" version of the Sieve in my  
> comparisons.  Having done so, Lennart wrote (slightly rephrased):
> >How did you compare the C version with the Haskell versions? The  
> >Haskell programs produce the Nth prime, whereas the C code produces  
> >the last prime less than M.

I've taken the liberty of adding the benchmark programs to the nobench suite,


so they'll be run across a range of haskell compilers.

-- Don

More information about the Haskell-Cafe mailing list