> From: Daniel Martin [mailto:martin / snowplow.org] 
> Sent: Monday, July 10, 2006 4:18 AM
> 
> Simon Kröçer <SimonKroeger / gmx.de> writes:
> 
> > (this is my second version, the other one is longer and 
> uses a slightly
> > other algorithm (and is sometimes even faster) but i like this one)
> 
> Huh.  I must say that when I saw your program, it wasn't at all what I
> expected - namely, you are changing all 26 letters at once, and then
> recalculating.  I had assumed you were doing one letter at a time,
> which I found to be much, much faster than doing all 26 at once.

Ok, I will post my other version as soon as I'm home again.
Btw: nice idea to use Bignums :)

> I'm going to have to look into NArray, clearly.  In fact, I think I'll
> try converting my solution to use NArray.

yes, some of the stuff is a little bit mind bending (using 'true' or
'false' for slicing dimensions for example) but you get true C speed
while implementing in ruby - that's fun.

cheers

Simon