Body:
I'm aware that Array already has sort capabilities, and that they work quite well. What I'm considering, though, is developing a general Sort library that contains many different sort methods, such as bubble (for the most basic, shortest lists), heap, quick, merge, etc. . . This library should be able to sort lists of any object that supports greater-than comparisons, and should include methods for comparing the performance of different methods on the same data. And, needless, to say, it should be written in pure Ruby, with as few dependencies as possible (preferably none besides Ruby 1.6.8).

I'm going to bash out a test of this using bubble sort (because it's the simplest to write, yes) and see if I think it's worth pursuing further.

_dave