On 7/15/07, <b class="gmail_sendername">Sebastian Sylvan</b> &lt;<a href="mailto:sebastian.sylvan@gmail.com">sebastian.sylvan@gmail.com</a>&gt; wrote:<div><span class="gmail_quote"></span><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
I don&#39;t see what the point of this is? Why do timings of different<br>algorithms? Of course you could do the same optimization in any<br>language, so why do you think it&#39;s relevant to change the algorithm in<br>*one* of the languages and then make comparisons?
<br></blockquote></div><br>Sebastien,<br><br>Well, as you yourself said, different languages work differently, so there&#39;s no point in trying to directly implement the C# algorithm in Haskell: it just wont work, or it will be slow.&nbsp; The same works from Haskell to C#.
<br><br>So, you guys are Haskell experts, show the world what Haskell is capable of.&nbsp; Come up with algorithms to calculate prime numbers in Haskell that are:<br>- safe<br>- easy to understand/read/maintain<br>- fast<br><br>
I&#39;ll ditch the &quot;sieve of arastophenes&quot; rule if you like.&nbsp; Use any algorithm you like.&nbsp; Now that is fair I think?<br><br>I in turn will do my part to keep the C# version a step ahead of the Haskell version.&nbsp; It seems this is pretty easy :-D
<br><br>