[Haskell-cafe] In-place modification

Hugh Perkins hughperkins at gmail.com
Sun Jul 15 06:06:46 EDT 2007


Sebastian,

Why would I write a slow, complicated algorithm in C#?

I'm not making these comparisons for some academic paper, I'm trying to get
a feel for how the languages run in practice.

And really in practice, I'm never going to write a prime algorithm using
merge and so on, I'd just use the original naive Haskell algorithm, that
runs 500 times slower (at least) than my naive C# algo.  I'm just allowing
you guys to optimize to see how close you can get.

Note that the C# algo is not something created by C# experts, it's just
something I hacked together in like 2 minutes.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20070715/9174748c/attachment.htm


More information about the Haskell-Cafe mailing list