4 ms·
Of course they have been benchmarked. Both compile to native code, so performance can be roughly the same if the algorithms are the same. However, figuring out
by randomidiot123 7y ago
Of course they have been benchmarked. Both compile to native code, so performance can be roughly the same if the algorithms are the same. However, figuring out how to design a Haskell program that reaches maximum performance is very difficult, and the code probably won't be idiomatic.
- jolux 7y ago> Both compile to native code, so performance can be roughly the same if the algorithms are the same. Can and will are very different statements here though, particularly as the quality of a compiler makes an enormous difference in the performance of the resulting code.