Hi,

At Thu, 31 Jul 2003 21:54:31 +0900,
Brian Candler wrote:
> I've just been poking around and I see that ruby's sort is implemented by
> calling its own implementation of qsort()
> 
> This is fine except that qsort is not a 'stable' sort - i.e. elements with
> equal keys do not have their existing order preserved.

It's a well known trade-off.  Fast sorts are unstable or need
work area.

I guess it is not required as stable in all cases.  How about
new methods, #stable_sort and #stable_sort!?

-- 
Nobu Nakada