10 Feb
2007
10 Feb
'07
9:28 p.m.
Gah! Gmail has really broken defaults for posting to lists.
On 10/02/07, Creighton Hogg
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?)
--
Peter Berry