Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re: Perl vs. Python for prime numbers

by choroba (Abbot)
on Jun 13, 2013 at 21:35 UTC ( #1038845=note: print w/ replies, xml ) Need Help??


in reply to Perl vs. Python for prime numbers

I was able to transfer the logic using a block with last:

#!/usr/bin/perl use warnings; use strict; use feature qw(say); for my $n (2 .. 99) { PRIME: { for my $x (2 .. $n - 1) { last PRIME if 0 == $n % $x; } say $n, ' is a primer number'; } }

Update.
But I would rather use something like the following:

for my $n (2 .. 99) { my $is_prime = 1; $is_prime &&= $n % $_ or last for 2 .. sqrt $n; say $n, ' is a primer number' if $is_prime; }

Update 2: &&= used instead of *= to avoid large numbers.

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


Comment on Re: Perl vs. Python for prime numbers
Select or Download Code
Re^2: Perl vs. Python for prime numbers
by LanX (Canon) on Jun 14, 2013 at 07:49 UTC
    > $is_prime &&= $n % $_ or last for 2 .. sqrt $n;

    why so complicated, isn't a simple flag sufficient?

    #!/usr/bin/perl use warnings; use strict; use feature qw(say); for my $n (2 .. 99) { my $prime = 1; for (2 .. $n-1) { $prime = 0, last unless $n % $_; } say $n, ' is a primer number' if $prime; }

    Cheers Rolf

    ( addicted to the Perl Programming Language)

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (14)
As of 2014-07-31 16:05 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (249 votes), past polls