#2143: Yhc's sort is faster than GHC's
-----------------------------+----------------------------------------------
Reporter: NeilMitchell | Owner: NeilMitchell
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 daniel.is.fischer):
For pseudo-random lists, my measurements showed the Yhc code consistently
faster, though not very much (3-12%). For (rev)sorted or almost
(rev)sorted lists, Yhc's code is up to 10 times faster (according to my
measurements).
Any chance to get the Yhc code into GHC?
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/2143#comment:5>
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
