diff options
author | Arnold D. Robbins <arnold@skeeve.com> | 2015-02-04 06:16:22 +0200 |
---|---|---|
committer | Arnold D. Robbins <arnold@skeeve.com> | 2015-02-04 06:16:22 +0200 |
commit | 1e4b9e300f6bfb84e3187ba2085723d44af9c50f (patch) | |
tree | d3a76c02b0a507a433e0183c7e3bde038b7d473f /awklib/eg/prog/anagram.awk | |
parent | 6a4160dab42fb7e952b0b91a99eedd4bb6bb1d67 (diff) | |
download | egawk-1e4b9e300f6bfb84e3187ba2085723d44af9c50f.tar.gz egawk-1e4b9e300f6bfb84e3187ba2085723d44af9c50f.tar.bz2 egawk-1e4b9e300f6bfb84e3187ba2085723d44af9c50f.zip |
More O'Reilly fixes, through Chapter 11.
Diffstat (limited to 'awklib/eg/prog/anagram.awk')
-rw-r--r-- | awklib/eg/prog/anagram.awk | 6 |
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) { |