diff options
Diffstat (limited to 'Build/source')
-rw-r--r-- | Build/source/texk/web2c/cwebdir/ChangeLog | 4 | ||||
-rw-r--r-- | Build/source/texk/web2c/cwebdir/examples/wordtest.w | 2 |
2 files changed, 5 insertions, 1 deletions
diff --git a/Build/source/texk/web2c/cwebdir/ChangeLog b/Build/source/texk/web2c/cwebdir/ChangeLog index 8a8761e9c1b..4f602ec35a1 100644 --- a/Build/source/texk/web2c/cwebdir/ChangeLog +++ b/Build/source/texk/web2c/cwebdir/ChangeLog @@ -1,3 +1,7 @@ +2023-05-26 Andreas Scherer <https://ascherer.github.io> + + * examples/wordtest.w: Fix page number for Aragon and Seidel. + 2023-05-24 Andreas Scherer <https://ascherer.github.io> * refsort.ch: Make room for larger index entries. diff --git a/Build/source/texk/web2c/cwebdir/examples/wordtest.w b/Build/source/texk/web2c/cwebdir/examples/wordtest.w index 98de5aedc60..000166815d9 100644 --- a/Build/source/texk/web2c/cwebdir/examples/wordtest.w +++ b/Build/source/texk/web2c/cwebdir/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 |