aboutsummaryrefslogtreecommitdiffstats
path: root/awklib/eg/prog/anagram.awk
diff options
context:
space:
mode:
authorArnold D. Robbins <arnold@skeeve.com>2015-02-06 16:48:52 +0200
committerArnold D. Robbins <arnold@skeeve.com>2015-02-06 16:48:52 +0200
commit294d1ffbc998de4c13518cc899c019998f51bd23 (patch)
tree05480c91ae7c3cf93dd4b214a7312ef279bfff1b /awklib/eg/prog/anagram.awk
parent6d43d408d693fdb5770bb4dbffa51d4b26487d4b (diff)
parent71b7aa032ee4b1679b3475edd0c3442cb85f4a3a (diff)
downloadegawk-294d1ffbc998de4c13518cc899c019998f51bd23.tar.gz
egawk-294d1ffbc998de4c13518cc899c019998f51bd23.tar.bz2
egawk-294d1ffbc998de4c13518cc899c019998f51bd23.zip
Merge branch 'master' into wasted-byte
Diffstat (limited to 'awklib/eg/prog/anagram.awk')
-rw-r--r--awklib/eg/prog/anagram.awk6
1 files changed, 3 insertions, 3 deletions
diff --git a/awklib/eg/prog/anagram.awk b/awklib/eg/prog/anagram.awk
index 7ca14559..df2768d9 100644
--- a/awklib/eg/prog/anagram.awk
+++ b/awklib/eg/prog/anagram.awk
@@ -1,5 +1,5 @@
-# anagram.awk --- An implementation of the anagram finding algorithm
-# from Jon Bentley's "Programming Pearls", 2nd edition.
+# anagram.awk --- An implementation of the anagram-finding algorithm
+# from Jon Bentley's "Programming Pearls," 2nd edition.
# Addison Wesley, 2000, ISBN 0-201-65788-0.
# Column 2, Problem C, section 2.8, pp 18-20.
#
@@ -21,7 +21,7 @@
key = word2key($1) # Build signature
data[key][$1] = $1 # Store word with signature
}
-# word2key --- split word apart into letters, sort, joining back together
+# word2key --- split word apart into letters, sort, and join back together
function word2key(word, a, i, n, result)
{