I was wondering if anyone knows what sort of algorithm the 'sort' function
in the List module actually uses? In "The Haskell 98 Library Report", they
give an insertion sort implementation, but I find it hard to believe that
the library actually uses insertion sort.
Basically, I need O(n log n) s
On Wed, Oct 02, 2002 at 07:01:50AM -0400, David Roundy wrote:
> I was wondering if anyone knows what sort of algorithm the 'sort' function
> in the List module actually uses? In "The Haskell 98 Library Report", they
> give an insertion sort implementation, but I find it hard to believe that
> the
