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.