Sebastian,<br><br>Why would I write a slow, complicated algorithm in C#?<br><br>I&#39;m not making these comparisons for some academic paper, I&#39;m trying to get a feel for how the languages run in practice.<br><br>And really in practice, I&#39;m never going to write a prime algorithm using merge and so on, I&#39;d just use the original naive Haskell algorithm, that runs 500 times slower (at least) than my naive C# algo.&nbsp; I&#39;m just allowing you guys to optimize to see how close you can get.
<br><br>Note that the C# algo is not something created by C# experts, it&#39;s just something I hacked together in like 2 minutes.<br><br>