in reply to Prime Number Finder

You may as well write 
for($i=$o; $i<=$e; $i++){

[download]
as 
print "2 is prime\n" if $o == 2;
$o++ if $o % 2;
for my $i ( $i=$o; $i<=$e; $i+=2 ){

[download]
That way you start on an odd number and account for the only even number which is prime. There is no need to check even numbers after 2.

Replies are listed 'Best First'.
Re^2: Prime Number Finder
by dragonchild (Archbishop) on Nov 11, 2005 at 23:07 UTC
    $o++ if $o % 2 == 0;
    My criteria for good software:
    1. Does it work?
    2. Can someone else come in, make a change, and be reasonably certain no bugs were introduced?
[reply]
[d/l]

In Section Cool Uses for Perl