[libmath-prime-util-perl] 34/40: is_prime is faster now, so SophieGermain is over 2x faster

[Partha P. Mukherjee]

This is an automated email from the git hooks/post-receive script.

ppm-guest pushed a commit to annotated tag v0.30
in repository libmath-prime-util-perl.

commit 88d4390940699761e181203c9e1cb9f510b78573
Author: Dana Jacobsen <dana at acm.org>
Date:   Thu Aug 1 12:42:22 2013 -0700

    is_prime is faster now, so SophieGermain is over 2x faster
---
 bin/primes.pl | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/bin/primes.pl b/bin/primes.pl
index 97e4f68..1bca862 100755
--- a/bin/primes.pl
+++ b/bin/primes.pl
@@ -55,10 +55,10 @@ $| = 1;
 # time difference grows rapidly.
 #
 #          primes.pl    Math::NumSeq::SophieGermainPrimes
-#     1M     0.14s        0.18s
-#    10M     0.82s        3.89s
-#   100M     7.09s      793s
-#  1000M    64.2s       ? estimated >3 days
+#     1M     0.11s        0.18s
+#    10M     0.38        3.89s
+#   100M     2.98s     793s
+#  1000M    27.7s       ? estimated >3 days
 #
 # If given a non-zero start value it spreads even more, as for most sequences
 # primes.pl doesn't have to generate preceeding values, while NumSeq has to

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-perl/packages/libmath-prime-util-perl.git