aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorJames Smith <baggy@baggy.me.uk>2021-10-10 23:37:40 +0100
committerGitHub <noreply@github.com>2021-10-10 23:37:40 +0100
commit98835fe0246896c402604f48dade73cd3918548c (patch)
treeff1df59b2052365a829ca6825db03915a931a903
parentcef1d67bc4144aeab4b44a48529c10bec381d7c8 (diff)
downloadperlweeklychallenge-club-98835fe0246896c402604f48dade73cd3918548c.tar.gz
perlweeklychallenge-club-98835fe0246896c402604f48dade73cd3918548c.tar.bz2
perlweeklychallenge-club-98835fe0246896c402604f48dade73cd3918548c.zip
Update README.md
-rw-r--r--challenge-133/james-smith/README.md2
1 files changed, 2 insertions, 0 deletions
diff --git a/challenge-133/james-smith/README.md b/challenge-133/james-smith/README.md
index c50473185e..188174521f 100644
--- a/challenge-133/james-smith/README.md
+++ b/challenge-133/james-smith/README.md
@@ -100,6 +100,8 @@ So here is my first C programme for probably 30 years!
This is the limit for the algorithm (would need 20+ Gbytes for the 10 billion case)
+Note there is an additional about 0.08 second penalty for compiling the C code - so infact for less than 100,000 the perl code is faster in total...
+
### The C code
```c