Richard O'Keefe | 17 May 2012 03:13
Picon
Favicon

Re: Can Haskell outperform C++?

In a lecture today I presented (for quite other reasons) a simple combinatorial enumeration problem where
the difference between two algorithms was far larger than any plausible difference between programming
languages.  If a programming language makes it easier to explore high level alternative algorithms, you
may very easily end up with faster programs in a "slower" language.  (Sorry about the very long line: broken
return key.)

Gmane