Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re^4: a close prime number

by dragonchild (Archbishop)
on Feb 14, 2005 at 19:11 UTC ( #430894=note: print w/ replies, xml ) Need Help??


in reply to Re^3: a close prime number
in thread a close prime number

It's not.

use Benchmark qw( cmpthese ); my $large_number = 3 * 1234647389; cmpthese( -1, { modulo => sub { $large_number % 3 == 0 }, divide => sub { my $v; $v += $_ for split //, $large_number; $v % +3 == 0}, }); -------- Rate divide modulo divide 30919/s -- -99% modulo 2120579/s 6759% --

By a factor of 67 times faster. Or so ...

Being right, does not endow the right to be rude; politeness costs nothing.
Being unknowing, is not the same as being stupid.
Expressing a contrary opinion, whether to the individual or the group, is more often a sign of deeper thought than of cantankerous belligerence.
Do not mistake your goals as the only goals; your opinion as the only opinion; your confidence as correctness. Saying you know better is not the same as explaining you know better.


Comment on Re^4: a close prime number
Download Code
Re^5: a close prime number
by RazorbladeBidet (Friar) on Feb 14, 2005 at 19:15 UTC
    Darn - so !(faster in my head == faster in code) :)

    Thanks for the benchmarks, dragonchild.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://430894]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (15)
As of 2014-10-20 13:50 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    For retirement, I am banking on:










    Results (77 votes), past polls