From: "Alexander P. Javier" <alyx@...>
Date: 2005-03-17T15:33:40+09:00
Subject: Re: Stable sort?

unsubscribe

---------------------
[Alexander P. Javier]
[alyx@foo.ncc.gov.ph]
[alxjvr@gmail.com]
[alyxj5@hotmail.com]
[alyxj@yahoo.com]
---------------------
Message checked by: 
- Avast! Professional 4.6 [4.6.623/0511-0]
- Sygate Personal Firewall Pro 5.5.271 [4.0.2/1.0.1058] 
--------------------- 
 

     > -----Original Message-----
     > From: gabriele renzi [mailto:surrender_it@remove-yahoo.it] 
     > Sent: Thursday, March 17, 2005 02.10 pm
     > To: ruby-talk ML
     > Subject: Re: Stable sort?
     > 
     > Hal Fulton ha scritto:
     > 
     > > Given that, what is a good stable sort algorithm? 
     > Would it be too 
     > > inefficient to implement in Ruby or no?
     > 
     > AFAIK, python's sort is based on a alghoritm named 
     > something like "stable natural mergesort" wich is said 
     > to be quite impressive, but I know nothing about it. I 
     > guess implementing it in pure ruby would have bad 
     > performance, anyway.
     >