[Haskell-cafe] Optimization fun

Creighton Hogg wchogg at gmail.com
Sat Feb 10 16:49:52 EST 2007

On 2/10/07, Peter Berry <pwberry at gmail.com> wrote:
> Gah! Gmail has really broken defaults for posting to lists.
> On 10/02/07, Creighton Hogg <wchogg at gmail.com> wrote:
> > Hello Haskell-ers,
> > So a friend and I were thinking about making code faster in Haskell, and
> I
> > was wondering if there was a way to improve the following method of
> > generating the list of all prime numbers.  It takes about 13 seconds to
> run,
> > meanwhile my friend's C version took 0.1.  I'd love to learn a bit more
> > about how to optimize Haskell code.
> Which subproblem takes 13 seconds? (Surely generating a list of all
> primes will take an infinite amount of time, since there are
> infinitely many of them?)

Apparently I shouldn't send e-mails quickly, as it comes out as gibberish.
It was the first 10000.  The thirteen seconds was just approximate, but it
showed the C one was much faster, which I figured was because I had
constructed it poorly.  Apparently I had, and I even managed to type it in
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20070210/dd33b5de/attachment.htm

More information about the Haskell-Cafe mailing list