#2143: Yhc's sort is faster than GHC's
-----------------------------+----------------------------------------------
Reporter: NeilMitchell | Owner: igloo
Type: bug | Status: new
Priority: normal | Milestone: Not GHC
Component: libraries/base | Version: 6.8.2
Resolution: | Keywords:
Difficulty: Unknown | Os: Unknown/Multiple
Testcase: | Architecture: Unknown/Multiple
Failure: None/Unknown |
-----------------------------+----------------------------------------------
Comment (by guest):
I put together a little module tonight which uses Criterion 0.2 (0.4 won't
install under 6.10.2) to benchmark GHC & YHC sorts using ascending ints,
descending ints, random ints, and the Shakesperean corpus
(http://www.gutenberg.org/etext/100). (Besides the attachment, you can see
http://hpaste.org/fastcgi/hpaste.fcgi/view?id=14873#a14875 )
YHC, as measured by mean, won on all of them, even random and Shakespeare.
The margins were not all 2x, but the narrowest YHC victory was Shakespeare
- YHC averaged 25.3s while GHC puffed along at 29.5s.
Caveats: this was my first time using Criterion, no doubt there are major
inefficiencies and bad style etc.
But I doubt any of my errors were sufficient to upend the results. Given
the margins in a core function which is used all over the place (I grepped
through all the repos I've downloaded; 'sort' is used a *lot*), that the
replacement is correct and faster in all cases, I think not making the
change as soon as possible is a mistake. This is something that should
have been done yesterday, as the expression goes.
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/2143#comment:10>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler
_______________________________________________
Glasgow-haskell-bugs mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
