53 lines
1.0 KiB
Perl
53 lines
1.0 KiB
Perl
use strict;
|
|
use warnings;
|
|
use Time::HiRes qw(time);
|
|
|
|
sub get_primes7($) {
|
|
my ($n) = @_;
|
|
|
|
if ($n < 2) { return (); }
|
|
if ($n == 2) { return (2); }
|
|
# do only odd numbers starting at 3
|
|
my @s = ();
|
|
for (my $i = 3; $i < $n + 1; $i += 2) {
|
|
push(@s, $i);
|
|
}
|
|
# n**0.5 simpler than math.sqr(n)
|
|
my $mroot = $n ** 0.5;
|
|
my $half = scalar @s;
|
|
my $i = 0;
|
|
my $m = 3;
|
|
while ($m <= $mroot) {
|
|
if ($s[$i]) {
|
|
my $j = int(($m*$m - 3) / 2);
|
|
$s[$j] = 0;
|
|
while ($j < $half) {
|
|
$s[$j] = 0;
|
|
$j += $m;
|
|
}
|
|
}
|
|
$i = $i + 1;
|
|
$m = 2*$i + 3;
|
|
}
|
|
my @res = (2);
|
|
foreach (@s) {
|
|
push(@res, $_) if ($_);
|
|
}
|
|
return @res;
|
|
}
|
|
|
|
my $startTime = time();
|
|
my $periodTime = $ENV{RUN_TIME} || 5;
|
|
|
|
my @res;
|
|
my $iterations = 0;
|
|
while ((time() - $startTime) < $periodTime || $iterations < 3) {
|
|
@res = get_primes7(10000000);
|
|
print "Found ".(scalar @res)." prime numbers.\n";
|
|
$iterations++;
|
|
}
|
|
|
|
my $resultTime = time() - $startTime;
|
|
printf("Perl: %d iterations in %.03f seconds = %.03f seconds per 30 iterations\n",
|
|
$iterations, $resultTime, $resultTime/$iterations*30);
|