aboutsummaryrefslogtreecommitdiff
path: root/challenge-005
diff options
context:
space:
mode:
authorbagheera-sands <git@sandsscouts.org.uk>2019-04-23 09:22:12 +0100
committerbagheera-sands <git@sandsscouts.org.uk>2019-04-23 09:22:12 +0100
commitc25247d557faebf92a997d52222159cf9e596bb1 (patch)
tree262a17024858f4a66d364e5ac31af78c7e8b339d /challenge-005
parent75c977b4ce2b187f170e9d1c739071707b4e9237 (diff)
downloadperlweeklychallenge-club-c25247d557faebf92a997d52222159cf9e596bb1.tar.gz
perlweeklychallenge-club-c25247d557faebf92a997d52222159cf9e596bb1.tar.bz2
perlweeklychallenge-club-c25247d557faebf92a997d52222159cf9e596bb1.zip
slight fix to readme
Diffstat (limited to 'challenge-005')
-rw-r--r--challenge-005/james-smith/README.md5
1 files changed, 4 insertions, 1 deletions
diff --git a/challenge-005/james-smith/README.md b/challenge-005/james-smith/README.md
index 9bb2f55bdd..ea5280cda7 100644
--- a/challenge-005/james-smith/README.md
+++ b/challenge-005/james-smith/README.md
@@ -11,7 +11,6 @@ This is similar to the problems from last week - but really is actually simpler
create a signature for each word - and check that against the words in the main dictionary.
```
perl perl5/ch-1.pl teams < /usr/share/dict/british-english-insane
-perl6 perl6/ch-1.p6 teams < /usr/share/dict/british-english-insane
```
Now this can be slightly slow - as it is actioning the sort for every set of letters - we
@@ -19,6 +18,10 @@ can short cut this if the word has a different number of letters... so an extra
us about 66-75% of the time... [ As this is an optimized function we complete the
optimization by removing the function call overhead ]
+```
+perl perl5/ch-1a.pl teams < /usr/share/dict/british-english-insane
+```
+
# Problem 2
Using the same signature function above we create a data structure containing every key we