The sort code in the Yhc libraries is faster than GHC. In some cases its asymptotically better. Some benchmarks have shown a doubling in performance. I know why this is, but will need to make sure the code is as good as it can be, check all the benchmarks agree etc. Original work by Ian: http://www.haskell.org/pipermail/glasgow-haskell-users/2002-May/003376.html I will track this down and aim for a libraries proposal in a month or so. <details><summary>Trac metadata</summary> | Trac field | Value | | ---------------------- | -------------- | | Version | 6.8.2 | | Type | Bug | | TypeOfFailure | OtherFailure | | Priority | normal | | Resolution | Unresolved | | Component | libraries/base | | Test case | | | Differential revisions | | | BlockedBy | | | Related | | | Blocking | | | CC | | | Operating system | Unknown | | Architecture | Unknown | </details> <!-- {"blocked_by":[],"summary":"Yhc's sort is faster than GHC's","status":"New","operating_system":"Unknown","component":"libraries/base","related":[],"milestone":"","resolution":"Unresolved","owner":{"tag":"OwnedBy","contents":"NeilMitchell"},"version":"6.8.2","keywords":[],"differentials":[],"test_case":"","architecture":"Unknown","cc":[""],"type":"Bug","description":"The sort code in the Yhc libraries is faster than GHC. In some cases its asymptotically better. Some benchmarks have shown a doubling in performance. I know why this is, but will need to make sure the code is as good as it can be, check all the benchmarks agree etc.\r\n\r\nOriginal work by Ian: http://www.haskell.org/pipermail/glasgow-haskell-users/2002-May/003376.html\r\n\r\nI will track this down and aim for a libraries proposal in a month or so.","type_of_failure":"OtherFailure","blocking":[]} -->