`sort' implementation

[S.D.Mechveliani]

In addition to my previous note on the implementation of  minimum  and
the like, could you also revise the  List.sort  implementation?

For example, the  merge sorting,  it is 100 times cheaper on  
                                                        sort [1..6000]
than what shows  ghc-4.02.
And again, i was forced to hide the ghc `sort'.
The merge sorting costs  O( n*log(n) ), so it is good in any case.
Why not implement it?

------------------
Sergey Mechveliani
[EMAIL PROTECTED]