diff options
| -rw-r--r-- | challenge-005/james-smith/README.md | 5 |
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 |