On Sat, Jun 7, 2008 at 10:26 AM, Slavomir Kaslev <[EMAIL PROTECTED]> wrote: > Hello, > > I was just brushing my haskell-fu skills writing a solution for Google > Treasure Hunt Problem 4. Hers is what it looks like: > >> primes = sieve [2..] >> where >> sieve (p:xs) = p : sieve [x | x <- xs, x `mod` p /= 0]
Read this: www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf This is probably the biggest culprit in your code. :-) _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
