#2406: Data.List.sortFun
------------------------------+---------------------------------------------
Reporter: lpsmith | Owner:
Type: feature request | Status: closed
Priority: normal | Milestone:
Component: libraries/base | Version: 6.8.3
Severity: normal | Resolution: wontfix
Keywords: | Difficulty: Unknown
Testcase: | Architecture: Unknown/Multiple
Os: Unknown/Multiple |
------------------------------+---------------------------------------------
Comment (by lpsmith):
There is no semantic difference between the two functions. However,
there are runtime tradeoffs. After all, given {{{sortFun f list}}},
{{{f}}} will get called approximately {{2 * n * log n)}}} times, where n
is the length of {{{list}}}. Of course, the number of times it gets
called per element depends on the sorting algorithm and the initial
permutation of the list.
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/2406#comment:6>
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
