summaryrefslogtreecommitdiff
path: root/web/c_cpp/cweb/examples/wordtest.w
diff options
context:
space:
mode:
Diffstat (limited to 'web/c_cpp/cweb/examples/wordtest.w')
-rw-r--r--web/c_cpp/cweb/examples/wordtest.w2
1 files changed, 1 insertions, 1 deletions
diff --git a/web/c_cpp/cweb/examples/wordtest.w b/web/c_cpp/cweb/examples/wordtest.w
index 98de5aedc6..000166815d 100644
--- a/web/c_cpp/cweb/examples/wordtest.w
+++ b/web/c_cpp/cweb/examples/wordtest.w
@@ -166,7 +166,7 @@ default: print_usage: fprintf(stderr,
@*Treaps. The most interesting part of this program is its sorting algorithm,
which is based on the ``treap'' data structure of Aragon and Seidel
[{\sl 30th IEEE Symposium on Foundations of Computer Science\/} (1989),
-540--546].
+540--545].
@^Aragon, Cecilia Rodriguez@>@^Seidel, Raimund@>
A treap is a binary tree whose nodes have two key fields. The primary
key, which in our application is a word from the input, obeys