ebaf5d5ac8
* NEW: Do less iterations in benchmarks to get the result faster. * BUG: Fix 'sort.pl' bench. git-svn-id: svn://localhost/gambas/trunk@7438 867c0c6c-44f3-4631-809d-bfa615b0a4ec
44 lines
865 B
Perl
Executable file
44 lines
865 B
Perl
Executable file
#!/usr/bin/perl -w
|
|
|
|
use strict;
|
|
use warnings;
|
|
|
|
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 @res;
|
|
for (1..5) {
|
|
@res = get_primes7(10000000);
|
|
print scalar @res; print "\n";
|
|
}
|