[Haskell-cafe] Re: (flawed?) benchmark : sort

Malcolm Wallace malcolm.wallace at cs.york.ac.uk
Mon Mar 10 05:57:00 EDT 2008

On 10 Mar 2008, at 08:36, Neil Mitchell wrote:
> Can whoever picks this up please try the sort code from Yhc in their
> comparisons. In my benchmarks it ran up to twice as fast as the GHC
> code. http://darcs.haskell.org/yhc/src/packages/yhc-base-1.0/Data/List.hs

I believe the Yhc sort implementation is faster because Lennart did  
some extensive performance tuning of sorting with hbc, about ten years  
ago, and contributed the resulting winner to nhc98 way back then.


More information about the Haskell-Cafe mailing list