Re^2: A mod2 Machine.

Use Benchmark to find out.

Also, using floats to compute modulo does not seem reasonable to me.

لսႽ† ᥲᥒ⚪⟊Ⴙᘓᖇ Ꮅᘓᖇ⎱ Ⴙᥲ𝇋ƙᘓᖇ

Comment on Re^2: A mod2 Machine.

Replies are listed 'Best First'.
Re^3: A mod2 Machine. by code-ninja (Scribe) on Jul 10, 2013 at 17:30 UTC
I was just about to say that! zork42 please do benchmark it and post the results. PS: I'm really very lazy to do that and plus I'm busy perusing the perldoc's PerlRE tutorial. :)	[reply]
Re^4: A mod2 Machine. by zork42 (Monk) on Jul 13, 2013 at 09:26 UTC
(Please see: my reply below.)	[reply]