aboutsummaryrefslogtreecommitdiff
path: root/challenge-014/ruben-westerberg/README
diff options
context:
space:
mode:
Diffstat (limited to 'challenge-014/ruben-westerberg/README')
-rw-r--r--challenge-014/ruben-westerberg/README6
1 files changed, 4 insertions, 2 deletions
diff --git a/challenge-014/ruben-westerberg/README b/challenge-014/ruben-westerberg/README
index 1a3a15799b..7a30900455 100644
--- a/challenge-014/ruben-westerberg/README
+++ b/challenge-014/ruben-westerberg/README
@@ -1,7 +1,9 @@
Solution by Ruben Westerberg
ch-1.pl and ch-1.p6
- Run each program with a single argument 4 digit year to print dates of last Friday of the month
+===
+Simply run the program to generate the Van Eck’s sequence. If no argument is provided the first 10 items are printed.
ch-2.pl and ch-2.p6
- Run each program with the a single parameter argument which is the sequence size to print. If no argument is provided a default value of 10 is used.
+===
+Run the program to find the longest English word possible from US state abbreviations. Uses words_alpha.txt as valid word list. An external word list can be used by providing its path as a single argument.