From: ts Date: 2001-05-17T00:27:18+09:00 Subject: [ruby-talk:15284] Re: Pluggable sorting - How would you do it? >>>>> "B" == Benjamin J Tilly writes: B> I would think that a better optimization would be to instead B> implement sort internally as a Schwartzian sort - do the method B> lookups on the way in so they are immediately available inside. Do the method lookup on what ? The first element in the array ? Guy Decoux