<br><br><div><span class="gmail_quote">On 2/10/07, <b class="gmail_sendername">Peter Berry</b> <<a href="mailto:firstname.lastname@example.org">email@example.com</a>> wrote:</span><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
Gah! Gmail has really broken defaults for posting to lists.<br><br>On 10/02/07, Creighton Hogg <<a href="mailto:firstname.lastname@example.org">email@example.com</a>> wrote:<br>> Hello Haskell-ers,<br>> So a friend and I were thinking about making code faster in Haskell, and I
<br>> was wondering if there was a way to improve the following method of<br>> generating the list of all prime numbers. It takes about 13 seconds to run,<br>> meanwhile my friend's C version took 0.1. I'd love to learn a bit more
<br>> about how to optimize Haskell code.<br><br>Which subproblem takes 13 seconds? (Surely generating a list of all<br>primes will take an infinite amount of time, since there are<br>infinitely many of them?)</blockquote>
<div><br>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 wrong.