ES wrote:
>>> Mergesort is a good choice. Efficency should be reasonable depending
>>> upon data set sizes. Therea re of course other possiblities. When in
>>> doubt:
>>>
>>> D. E. Knuth. The Art of Computer Programming, Volume 3: Sorting and
>>> Searching. Addison-Wesley, Reading MA, 1973.
>>
>>
>>
>> Yes... I always had one handy, but now I don't. I should actually
>> buy one.
>>
>> Anyone ever implemented mergesort in Ruby? Got one handy?
> 
> 
> Looks like the invaluable Bruno R Preiss has quite a few algorithms
> in his back pocket: http://www.brpreiss.com/books/opus8/programs/

I was just looking at that... but I don't yet get it.

Does "merge" imply two lists? I'm just looking at a single list.


Hal