[Haskell-cafe] Re: Haskell Speed
simons at cryp.to
Fri Dec 23 15:59:37 EST 2005
Daniel Carrera writes:
> If the results could be trusted, they would be useful.
> You could balance the expected loss in performance
> against other factors (e.g. speed of development).
How do you measure the time it takes to come up with a
QuickSort algorithm that, implemented in Haskell, crushes
the MergeSort algorithm all other languages use? ;-)
More information about the Haskell-Cafe