| If you want others, check out Ralf Hinze's pages at
|
|http://www.informatik.uni-bonn.de/~ralf/
Actually,
http://www.informatik.uni-bonn.de/~ralf/Sort.tar.gz
The library includes several adaptive sorting algorithms, an O(n log n)
`quick sort' (aka introspective sort) ...
Have a look at the Util module in '-syslib misc', it provides
a variety of sorting algorithms, including said merge sort.
If you want others, check out Ralf Hinze's pages at
http://www.informatik.uni-bonn.de/~ralf/
--Sigbjorn
[EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]] writes:
Carl
[EMAIL PROTECTED] writes:
To my
Indeed, i voice for the merge sort ...
Sigbjorn Finne [EMAIL PROTECTED] writes
Have a look at the Util module in '-syslib misc', it provides
a variety of sorting algorithms, including said merge sort.
If you want others, check out Ralf
Quite impressed with 4.02 so far -- it walks the walks, see promohype
elsewhere, why should I give you all too much free advertising? ;-)
It does indeed seem to be more go-faster than 3.02, _but_:
No profiling! Boo, hiss.
Funny space behaviour -- a module I have that contains just one
Parting shot: isAlphaNum vs. isAlphanum? Haven't we been here before?
Don't the committee have more amusing (and less pointless and gratuitously
program-breaking) things to tinker with? (I know, nothing to do with
ghc, I'm just in a mood to 'give out'...)
Ah, but each new committee has to
