Date Sorting...

John Hughes
Thu, 14 Mar 2002 11:39:09 +0100 (MET)

> Sorting is probably easiest if you use the standard sort function.  I'm
> still kind of interested in whether anyone has done work on which
> purely-functional sorts are efficient, and particularly which ones are
> efficient in GHC.

I think it was Oege de Moor who compared a number of sorting algorithms in
Haskell. It turned out that the quicksort we all know and love is very
slow: it is much better to use merge sort. Maybe Oege remembers more

John Hughes