Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re: Prime Number Finder

by Anonymous Monk
on Feb 20, 2002 at 13:03 UTC ( #146564=note: print w/replies, xml ) Need Help??


in reply to Prime Number Finder

Just a thought, but if you were to increment the first for loop by 2, (primes can't be even with the exception of 0 and 2) you only have to calculate half the iterations, making it twice as fast

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://146564]
help
Chatterbox?
[holli]: check this out
[holli]: this is the clent to poll the cb, complete with event loop and asynchronity and all
[holli]: https://hastebin. com/yusuxivono.pl
[Corion]: holli: Nice ;)
[moritz]: you could add a whenever signal(SIGTERM) { ... } handler for a clean exit

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (3)
As of 2017-09-23 12:38 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    During the recent solar eclipse, I:









    Results (272 votes). Check out past polls.

    Notices?