THE ART OF COMPUTER PROGRAMMING 

 ERRATA TO VOLUME 1 (after 2010) 

This do ument is a trans ript of the notes that I have been making in my
personal opy of The Art of Computer Programming, Volume 1 (third edition,
27th printing), sin e it was rst printed in 2011. Previous errata are re orded in
another le `all1-pre.ps'.
Four levels of updates | \errors," \amendments," \plans," and \improve-
ments" | appear, indi ated by four dierent typographi onventions:
x
Page 666 line 1 04 Jul 1776
Te hni al or typographi al errors (aka bugs) are the most riti al items, so they
x
are agged with a ` ' pre eding the page number. The date on whi h I rst
was told about the bug is shown; this is the ee tive date on whi h I paid the
nder's fee. The ne essary orre tions are indi ated in a straightforward way.
If, for example, the book says `n' where it should have said `n + 1', the hange
is shown thus:
n y n+1

Page 666 line 2 14 Jul 1789

Amendments to the text appear in the same format as bugs, but without the ` '. x
These are things I wish I had known about or thought of when I wrote the original
text, so I added them later. The date is the date I drafted the new text.
Page 666 line 3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 Nov 1917
Plans for the future represent a third kind of item. In su h notes I sket hed
my intentions about things that I wasn't ready to esh out further when I wrote
them down. You an identify these items be ause they're written in slanted type,
and pre eded by a bun h of dots `. . . . . . . . . . . . ' leading to the date on whi h I
re orded the plan in my les.
Page 666 line 4 10 Jan 1938
The fourth and nal ategory | indi ated by page and line number in smaller, slanted
type | onsists of minor orre tions or improvements that most readers don't want to
know about, be ause they are so trivial. You wouldn't even be seeing these items if
you hadn't spe i ally hosen to print the omplete errata list in all its gory details.
Are you sure you wanted to do that?
My shelves at home are bursting with preprints and reprints of signi ant
resear h results that I want to digest and summarize, where appropriate, in the
ultimate edition of Volume 1. I didn't do that in the third edition be ause I
would surely have to do it over again later: New results ontinue to pour forth
at a great rate, and I will have time to rewrite that volume only on e. Volumes
4 and 5 need to be nished rst. So I've put most of my eort so far into writing
up those parts of the total pi ture that seem to have onverged to their near-nal
1
2 INTRODUCTION

form. It follows, somewhat paradoxi ally, that the updates in this do ument are
most urrent in the areas where there has been least a tivity.
On the other hand I do believe that the hanges listed here bring Volume 1
ompletely up to date in two respe ts: (1) All of the resear h problems in the
previous edition | i.e., all exer ises that were rated 46 and above | have re eived
new ratings of 45 or less whenever I learned of a solution; and in su h ases, the
answer now refers to that solution. (2) All of the histori al information about
pioneering developments has been amended whenever new details have ome to
my attention.
The ultimate, glorious, 100% perfe t editions of Volumes 1{4A are works in
progress. Please let me know of any improvements that you think I ought
to make. Send your omments either by snail mail to D. E. Knuth, Computer
S ien e, Gates Building 4B, Stanford University, Stanford CA 94305-9045, or
by email to tao p s.stanford.edu. (Use email for book suggestions only,
please | all other orresponden e is returned unread to the sender, or dis arded,
be ause I have no time to read ordinary email.) Although I'm working full time
on Volume 4B these days, I will try to reply to all su h messages within a year
of re eipt. Current news about The Art of Computer Programming is posted on
http://www- s-fa ulty.stanford.edu/~knuth/tao p.html
and updated regularly.
| Don Knuth, January 2011

What happened?
The subje t took the bit in its teeth and ran away with it,
that's what happened.
I know now how Sir James Frazer felt when,
after setting out to dash o a brief monograph
on a single obs ure rite, he found himself
in the embarrassing possession of
the 12 volumes of \The Golden Bough."
| WAVERLEY ROOT (1974)

No matter how many times you proofread your book,

after publi ation there will be roughly one typo per page.
| JOSEPH H. SILVERMAN (2017)
  FUNDAMENTAL ALGORITHMS 
Copyright
2011, 2012, : : : , 2019, 2020, 2021 Addison{Wesley
Last updated 10 February 2021

Most of these orre tions have already been made in re ent printings.
x
Page 0 (on the ba k page of the dust over, line 23) 10 Sep 2012
Whatever your ba kgound, y Whatever your ba kground,

x
Page v line 8 13 De 2018
M Call's Cookbook y M Call's Cook Book
x
Page x line 14 24 Mar 2016
Ameri an Mathemati al Monthly y The Ameri an Mathemati al Monthly
Page xi new paragraph to follow line 20 25 Nov 2013
My eorts to extend and enhan e these volumes have been enormously enhan ed
sin e 1980 by the wise guidan e of Addison{Wesley's editor Peter Gordon. He
has be ome not only my \publishing partner" but also a lose friend, while
ontinually nudging me to move in fruitful dire tions. Indeed, my intera tions
with dozens of Addison{Wesley people during more than three de ades have
been mu h better than any author deserves. The tireless support of managing
editor John Fuller, whose meti ulous attention to detail has maintained the
highest standards of produ tion quality in spite of frequent updates, has been
parti ularly praiseworthy.
Page xi line 5 before the author's signature 23 Sep 2015
nobody noti ed y nobody else noti ed
Page xiv date of the Herbert quotation 26 Nov 2019
(1640) y (1651)

Page xiv repla ement for the Vauvenargues quotation 21 De 2019

Les meilleurs auteurs parlent trop.
| VAUVENARGUES, Paradoxes, m^ eles de Re exions et Maximes, 115 (1746)
Page xvi line 16 16 Jun 2011
a 45 rating y a 40 rating
Page xvi line 20 30 Jan 2013
reativity. y reativity. All exer ises with ratings of 46 or more are open
problems for future resear h, rated a ording to the number of dierent atta ks
that they've resisted so far.
Page 2 line 7 13 Sep 2019
also usually appears y often appears also
3
 4 CHANGES TO VOLUME 1: FUNDAMENTAL ALGORITHMS

Page 6 lines 1{3 13 Mar 2013

y
fm; ng m and n [twi e℄
y
fn; rg n and r [twi e℄
Page 8 lines 5 and 4 13 Mar 2013
Su h a omputational method : : : it is also yEvery step of su h a omputational
method is learly ee tive, and experien e shows that pattern-mat hing rules of this
kind are also
Page 8 line 11 30 Jul 2019
for strings  and ! y for some strings  and ! in A.
Page 9 the rating of exer ise 7 05 Apr 2014
M21 y HM21
Page 11 lines 3{4 06 May 2015
An expansion : : : an y A more leisurely presentation of mu h of the following
material, together with related on epts, an
Page 13 line 3 after (3) 06 Feb 2021
F2 = 1 < 1:6 < 1 y F2 = 1 < 1
Page 15 line 13 20 Apr 2019
onsists of proving y onstru ts a proof
x
Page 17 line 26 15 De 2013
11 (1838) y 12 (1838)

Page 18 repla ement for line 5 of exer ise 2 19 Apr 2019

a(n+1) 1 = an = a n 1a 11
n 1 n 1
= = 1; where b = a(n 2)=(n 1)
;
b 1
Page 18 lari ation in exer ise 4 10 Feb 2013
n 2 . y n 2 for all positive integers n.
Page 19 lari ation in exer ise 5 line 1 05 Feb 2013
exa t divisors y positive integer divisors
Page 19 in exer ise 9 13 Sep 2019
1 na y1 na for all integers n
Page 22 lines 1 and 3 after (8) 20 Jan 2013
10x y bx [two pla es℄
Page 22 line 3 after (8) 17 Sep 2019
y
is 1.999: : : begins with 1.999: : :
Page 23 line 1 after (13) 22 Feb 2015
Edward M. Reingold. y Ernesto Tru o [Bull. Math. Biophysi s 18 (1956),
130℄.
 CHANGES TO VOLUME 1: FUNDAMENTAL ALGORITHMS 5

Page 25 lines 1 and 2 of exer ise 11 22 Nov 2019

and x  log10 2, to how : : : value of x in order to determine y
and x is approximately
equal to log10 2, how many de imal pla es of x's value will guarantee that we an
determine
Page 25 in exer ise 18 22 Nov 2019
1 lg x
2 y
2 lg x, for all real x > 0.
1

x
Page 27 line 1 22 Jul 2011
n>1 y n > 1 and n 6= e.
Page 29 repla ement for ve lines after (9) 22 De 2019
where S 0 (j ) spe ies summing over all j su h that \there is an integer i su h
that both R(i) and S (i; j ) are true"; and R 0 (i; j ) spe ies summing over all i
su h
Pn Pi
that \both R(i) and S (i; j ) are true." For example, if the summation is
0
i=1 j =1 aij , then S (j ) sums over j where \there is an integer i su h that
1  i  n and 1  j  i," that is, 1  j  n; and R 0 (i; j ) sums over i where
\1  i  n and 1  j  i," that is, j  i  n. Thus,
Page 30 last line of Example 1 20 Apr 2019
onsists of simplifying y
simplies
Page 35 repla ement for line 2 of exer ise 18 22 De 2019
R(i) spe ies summing over all i su h that \n is a multiple of i" and S (i; j ) spe ies
summing over all j su h that \1  j < i."
Page 37 line 10 after `EXERCISES|Se ond Set' 14 May 2020
is ( 1)i+j times y is 1 if n = 1, otherwise it's ( 1)i+j times
Page 37 in the three matri es displayed at the bottom 22 Nov 2019
[insert verti al dots in the se ond olumn, to mat h those in the rst and last olumns℄
x
Page 38 last line of exer ise 40 14 May 2020
1 when j = n y( 1)n 1
when j = n
Page 45 line 2 of exer ise 48 14 May 2020
l
mm y
l m
m ; if n 6= 0;
n n
Page 47 repla ement for displayed formula (7) 22 Jan 2019
p  n + 1=2 n+1=2 p  n n
n!  2  2n : (7)
e e
x
Page 50 line 5 15 Jun 2014
della S ienze y
delle S ienze
Page 52 last line of exer ise 24 22 Jun 2020
k=(k 1).℄ y
k=(k 1) when k > 1.℄
 6 CHANGES TO VOLUME 1: FUNDAMENTAL ALGORITHMS

Page 61 repla ement for the bottom 7 lines 16 Nov 2016

to use Eq. (20) | whi h no longer applies.
In this situation it pays to ompli ate things even more, by repla ing the
unwanted mn+2 +k
by a sum of terms of the form x+k
, sin e our problem will
k 2k
then be ome a sum of problems that we know how to solve. A ordingly, we use
Eq. (25) with
k 7! j; r 7! n 1; m 7! m 1; s 7! k; n 7! 2k;
all of the onditions required for (25) are satised, be ause m and n are positive.
Page 62 repla ement for the top 18 lines 16 Nov 2016
The sum to be solved now takes the form
X nX1 n 1 j
 k + j  2k  ( 1)k
; (29)
k j =0
m 1 2k k k+1

and the rest is easy, by inter hanging the order of summation: Equation (28) tells
us how to sum on k , and all the ompli ations melt away. Everything redu es
to just
X1 n 1 j 
n
Æj 0 ;
m 1
j =0
so our nal answer is n 1
:
1 m
The solution to this problem was fairly ompli ated, but not really myste-
rious; there was a good reason for ea h step. The derivation should be studied
losely, be ause the use of (25) illustrates some deli ate maneuvering with the
onditions in our equations.
There is a tually a better way to atta k this problem, however! The reader
is invited to gure out how to transform the given sum so that Eq. (26) applies
(see exer ise 30).
Page 70 in exer ise 25 07 O t 2013
line 1: as in Eq. (30). y as in Example 4 (see Eq. (30)).
line 5: the identity ymultiples of a spe ial ase of (34),
x
Page 70 line 2 of exer ise 25 07 O t 2013
provided z is small enough y provided that x is lose enough to 1
Page 79 new exer ise for Se tion 1.2.7 11 Feb 2013
(u;v ) P (0;v ) (u;0)
25. [M21 ℄ Let Hn = 1j kn 1=(j k ). What are Hn and Hn ? Prove the
u v

general identity Hn(u;v) + Hn(v;u) = Hn(u) Hn(v) + Hn(u+v).

x
Page 79 line 3 after (2) 24 Jan 2021
(Book of the Aba us) y (Book of Cal ulation)
 CHANGES TO VOLUME 1: FUNDAMENTAL ALGORITHMS 7

repla ement for line 3 06 Feb 2021

Page 83,
p
Fn =  = 5 rounded to the nearest integer, for all n  0.
n
(15)
Page 85 the displayed formula in exer ise 24 20 Jan 2017
insert `det' before the matrix
x
Page 100 line 5 24 Jul 2020
Roes CACM y
Roes, CACM
Page 104 line 11 26 Jun 2014
random variable y random integer
Page 104 new senten e pre eding the exer ises 19 Jul 2012
[S. Bernstein had ontributed key ideas in U henye zapiski Nau hno-
Issledovatel'skikh kafedr Ukrainy 1 (1924), 38{48.℄
Page 110 lines 14{16 01 Jul 2014
We have : : : This equation y We have
pn n = eln n=n = 1 + (ln n=n) + O (log n=n)2


; (18)
be ause log n=n ! 0 as n ! 1; see exer ises 8 and 11. (Noti e that we needn't
spe ify the base of `log' inside O-notation, where onstants are ignored.) This
equation
Page 111 line above Fig. 12 08 Jul 2012
Petropolitan y
Imperialis Petropolitan
Page 114 line 7 26 Feb 2013
is less than y
is less in absolute value than
Page 116 line 2 of exer ise 8 18 Feb 2012
n2
n


/ n n2
n


y n2
n


/( n n2
n


)
Page 144 line 2 29 Nov 2011
to zero. y to zero, and the over ow toggle is leared.
Page 145 line 5 28 Feb 2018
X [i℄  CONTENTS(X + i) y CONTENTS(X + i)  X [i℄.
Page 151 line 11 29 Nov 2011
set to zero y
set to positive zero
x
Page 161 line 7 22 Mar 2018
rn (1=me ) = r. y rn (1=me) = r. Stop if r = 0.
Page 173 line 3 after the table 15 De 2013
table. y
table, ex ept that the unknown destination of e is represented there by `)'
not `?'.
 8 CHANGES TO VOLUME 1: FUNDAMENTAL ALGORITHMS

Page 196 line 4 28 Feb 2018

ALF y ALF
x
Page 197 lines 25{26 28 Feb 2018
rI1 possibly y rI1, rI4 possibly
x
Page 221 line 13 (in 32nd to 40th printings only) 08 May 2019
depi ted in Fig. 24 y
depi ted in Fig. 27
x
Page 229 line 11 06 Feb 2011
Me hanization y
Me hanisation
Page 229 lines 25{29 19 De 2015
see Pro eedings : : : 87{90; B. E. Carpenter : : : 78{79. y
see B. E. Carpenter
: : : 78{79. See also H. D. Huskey's mention of \reversion storage" in Pro eedings
: : : 87{90.

Page 242 line 2 28 Apr 2012

top, front y top, bottom, front
x
Page 268 program line 71 30 Jun 2012
QLINK(F) y QLINK[F℄
Page 270 rewording of exer ise 13 15 Mar 2018
13. [HM48 ℄ How many ways are there to arrange the 2n subsets des ribed in exer-
ise 12 into topologi al order? (Try for a \sharp" asymptoti estimate as n ! 1.)
Page 275 line 7 06 Sep 2012
list have y
list must have
x
Page 286 table entry for time 4820, olumn D3 03 De 2017
0 y X

Page 303 in the line before (13) 29 Aug 2011

transformation: ytransformation (see M. H. Doolittle, Report of the Super-
intendent of the U.S. Coast and Geodeti Survey (1878), 115{120):
Page 331 rating of exer ise 14 15 Aug 2012
22 y 20
x
Page 339 repla ement for line 17



14 Mar 2011
D(y ) = 3 1=(x + 1) (a(2x))=(x2 )2 ; (21)
Page 364 near the top 20 Jan 2020
0 0 y
line 5: paths (V; V1 ; : : : ; V ) and (V; V1 ; : : : ; V ), 0 paths (V0 ; V1 ; : : : ; Vs ) and
(V00 ; V10 ; : : : ; Vt0 ), where V0 = V00 = V and Vs = Vt0 = V 0 ,
y
line 7: path (Vk 1 ; Vk0 ; : : : ; V 0 ; : : : ; Vk )
path (Vk 1 ; Vk0 ; : : : ; Vt0 1 ; V 0 ; Vs 1 ; : : : ; Vk )
 CHANGES TO VOLUME 1: FUNDAMENTAL ALGORITHMS 9

x
Page 374 line 2 22 Aug 2019
J. London Math. So . 21 (1947) y J. London Math. So . (2) 21 (1946)
Page 385 repla ement for line 5 12 Aug 2017
J = (D; U; ; X ) K = ( ; Y; R; L ) N = (Y; ; X; ) =( ; ; ; )
[Also, B y  on lines 11{14, 17; omit B on lines 18 and 27.℄

Page 407 lines 12{17 25 May 2017

Catalan numbers o ur : : : Catalan onne tion y
Catalan numbers o ur in an enormous number of ontexts: Ri hard Stan-
ley's fas inating book Catalan Numbers (2015) features 214 dierent ombina-
torial interpretations, and also in ludes an appendix by Igor Pak that gives a
denitive history of the subje t. The most surprising of all these instan es may
well be the Catalan onne tion
Page 465 new quotation (to follow the one by Lehmer) 18 Aug 2013

I must explain, to begin with,

that all the Trees, in this system, grow head-downwards:
the Root is at the top, and the Bran hes are below.
If it be obje ted that the name \Tree" is a misnomer, my answer
is that I am only following the example of all writers on Genealogy.
A Genealogi al tree always grows downwards:
then why may not a Logi al \Tree" do likewise?
| LEWIS CARROLL, in Symboli Logi (1896)

Page 466 new answer for exer ise 6 28 De 2017

6. Trying Algorithm E with n = 5 and m = 5q + (1, 2, 3, 4, 5), for any q  0, we nd
that step E1 is exe uted (2, 3, 4, 3, 1) times, respe tively. So the average is 2:6 = T5 .
Page 466 append new opy at the end of answer 7 10 Aug 2014
For example, try m = 5 and n = 1, 2, : : : : The average of 1, 2, 3, 2, 1, 3, 4, 5, 4, 2, 3,
4, 5, 4, 2, : : : is 3.6.
Page 467 new line at end of answer 8 29 Apr 2013
Ea h iteration either de reases m or keeps m un hanged and de reases n.
Page 468 repla ement for answer 2 19 Apr 2019
2. The formula for b involves division by zero when n = 1. Therefore the theorem
has not been proved when n + 1 = 2.
Page 468 new answer 13 Sep 2019
9. It's true when n = 0; also whenever it's known to be true for n + 1 or n 1.
Page 469 new lines at end of answer 8 26 Feb 2013
This onstru tion an't make dk = 9 for all k > l, be ause that ould happen only if
(n + d1 =10 +


+ dl =10l + 1=10l )m  u.
Page 470 line 2 of answer 11 17 Sep 2019
10 = 1:99999 : : :
x
y 10x begins with 1:99999 : : :
 10 CHANGES TO VOLUME 1: FUNDAMENTAL ALGORITHMS

Page 470 in step E1 of answer 28 28 O t 2011

If 1  : : : k 1. y
Set x 1  x, y y0 , and k 1, where 1  is the largest
possible value of x, and y0 is the nearest approximation to b1  .
Page 471 new answer 18 22 De 2019
18. S 0 (j ) sums over j with \1  j < n". R 0 (i; j ) sums over i with \n is a multiple of
i and i > j ".
Page 472 repla ement for last line of answer 26 12 Jun 2020
Qn Qn Qn
The answer is P1 = (P1 P2 ) = ( i=0 ai ) , be ause P1 = ( i=0 j =i ai aj ) = P2 .
1=2 n+2

Page 472 new opy for end of answer 31 20 O t 2011

Pn Pn Pn
Consequently we have ( j =1 uj )( j =1 vj )  n j =1 uj vj when u1  u2 


 un
and v1  v2 


 vn , a result known as Chebyshev's monotoni inequality. [See
Soobsh h. mat. obsh h. Khar'kovskom Univ. 4, 2 (1882), 93{98.℄
Page 474 lines 3{5 of answer 43 26 Nov 2011
as in exer ise 44 Q: : : (xi 1)).
Q y
by setting x = 1 in exer ise 40 and obtaining
k6=i (xk 1)=xi k6=i (xk xi ). After multiplying numerator and denominator by
xi 1, we an sum on i by applying exer ise 33 with r = 0 to the n + 2 numbers
f0; 1; x1 ; : : : ; xn g.
Page 476 repla ement for answer 4 22 De 2013
4. By part (f), x  dxe < x + 1; hen e x 1< dxe  x; use part (e).
x
Page 484 lines 4 and 5 of answer 10 28 May 2018
terms y fa tors (twi e)
Page 485 repla ement for answer 22 10 Sep 2013
22. Assume that n > 0. The kth term is r=(r tk) times
1 n Y Y
(r tk j ) (n 1 r + tk j )
n! k 
0 j<k 
0 j<n k
1
=
( 1)k n  Y ( r + tk + j ) Y ( r + tk + j )
n! k 0j<k kj<n

and the two produ ts give a polynomial of degree n 1 in k after division by r tk.
So the sum over k is zero by Eq. (34).
Page 485 lines 2 and 3 of answer 25 07 O t 2013
(Alternatively : : : x = 1.) We have y When w is suÆ iently small, we have
Page 491 line 2 of answer 66 17 Apr 2015
y>n 1 y
yn 1
Page 491 repla ement for last line of answer 67 18 Feb 2012



n
k ( (n k+1)e k 1
k ) ek , whi h is less memorable (but often sharper) than n
k  ( nk )k .
Page 492 repla ement for answer 16 21 Jun 2016
16. H 2n 1H .
2 n
 CHANGES TO VOLUME 1: FUNDAMENTAL ALGORITHMS 11

Page 493 new answer for se tion 1.2.7 11 Feb 2013

Pn
25. Hn(0;v) =k=1 H (v )
n and H (u;0)
n = H (u 1)
n ; so the identity generalizes (8). [See
L. Euler, Novi Comment. A ad. S i. Pet. 20 (1775), 140{186, x2.℄
Page 495 last line of answer 34 10 Jul 2018
Generalizations : : : 7.1.3. y
For generalizations, see exer ise 4.5.3{52, exer ise 5.4.2{
10, and Se tion 7.1.3.
x
Page 503 last line of answer 3 05 Mar 2013
1937 y 1927
Page 504 last line of answer 8 18 Feb 2012
n2
n


/ n n2
n


y n2
n


/( n n2
n


)
Page 509 new answer 23 28 Feb 2018
23. First, by R. D. Dixon: Se ond, by George Wahid, if rA  0:
(3000) ENT1 4 DEC1 1 (3000) ENT1 5:5 DEC1 1:1
(3001) LDA 200 J1NN 3001 (3001) SLA 1 J1P 3001
SRA 0,1 SLAX 5 ST1 3003(4:4) HLT 0
SRAX 1 HLT 0 (3003) ADD 200(*)
Page 514 repla ement for line 5 of the program 30 Apr 2013
3H ENT2 9*8-8,1 Start at row 9.
x
Page 514 repla ement for lines 19 and 20 of the program 10 Mar 2013
PHASE2 ENT3 9*8 At this point rA = minj C (j )
3H ENT2 0,3 Prepare to sear h a row.
Page 518 line 14 27 Aug 2014
Vi torius of Aquitania y Vi torius of Aquitaine
x
Page 545 line 8 of answer 3 23 Apr 2019
rA INFO(rI1) y rA INFO(rI3)
Page 546 last lines of answer 9 30 Jun 2014
plagues many automati programming systems.) y plagued many automati pro-
gramming systems in the old days.)
Page 547 new answer 13 15 Mar 2018
13. Sha and Q
Kleitman

n

[Dis rete Math. 63 (1987), 271{278℄ proved that the number
is at most nk=0 nk k ; Brightwell and Q
Tetali


[Order 20 (2003), 333{345℄ improved
this upper bound to exp((2en2n=r)r nk=0 nk !), where r = (2n+1 2)=(n + 1). The
Q
n
obvious lower bound is nk=0 nk ! = 22 (n+O(log n)) . For the initial values han i =
h1; 1; 2; 48; 1680384; : : : i, up to a7  6:305  10137 , see OEIS sequen e A046873.
x
Page 552 in answer 12 30 Jun 2012
line 1: 29p y 27p
line 3: 43 y 78%
Page 570 new senten e to follow line 1 of answer 30 08 O t 2013
Thus LOC(T) = HEAD, and HEAD$ is the rst node of the binary tree in symmetri order.
 12 CHANGES TO VOLUME 1: FUNDAMENTAL ALGORITHMS

Page 570 line 3 of answer 30 08 O t 2013

the algorithm of exer ise 21 y Algorithm U in answer 21
Page 576 new answer(s) 09 Sep 2014
14, 15. See Martin Ward and Hussain Zedan, \Provably orre t derivation of algo-
rithms using FermaT," Formal Aspe ts of Computing 26 (2014), 993{1031.
Page 587 repla ement for top eight lines 12 Aug 2017
types (a, ÆNa, d, ÆNa, a, ÆNd, d) on the main diagonal have the form

a KQ b QP a K b
JP ÆNa R ÆKQ JL ÆNb P
 DS d YQT  S d
P Q ÆJP XP ÆNa RQ ÆR R
a KU b DP a K b
JT ÆN S ÆSD JS ÆNd T
 QS d DT  S d

Page 587 line 12 22 Jun 2019

For a similar y (Six of the 92 types an a tually be omitted; see exer ise 7.2.2.1{121.)
For a similar
Page 588 line 3 of answer 4 05 Jan 2020
at z = . y at z = . (See exer ise 7.2.2.2{348.)
Page 589 last line of answer 6 25 Feb 2018
140.℄ y 140. In identally, there are gn 1 oriented trees with n leaves and in-degree 2
at nonleaves.℄
Page 589 in answer 7 05 Jan 2020
a  2:483253536173. y and a  2:483253536173 satises F (1=a) = 0.
Page 598 last line of answer 3 28 De 2017
two. y two. See exer ises 7.2.1.6{26 through 7.2.1.6{34.
x
Page 607 lines 1{9 24 Jun 2016
[In some printings, the \primes" disappeared from step names; for example, step C50
was simply alled step C5.℄
x
Page 611 line 5 25 Jul 2014
inner loop A3* y inner loop A2.5*
x
Page 613 last line of answer 28 14 Apr 2014
AVAIL[k ℄ L. yAVAILF[k ℄ L.
Page 614 line 2 of answer 33 28 De 2017
Cohen and Ni olau y
J. Cohen and A. Ni olau
 CHANGES TO VOLUME 1: FUNDAMENTAL ALGORITHMS 13

Page 624 through page 626 07 Apr 2012

[repla e the notation (R =) x; y ) by (R? x: y ) in eleven pla es℄
Page 628 new entries for Appendix C 17 Apr 2011
Program 1.2.10M, 145, 186.
Program 1.4.3.1M, 204{211, 530.
Program 2.1A, 236.
Program 2.1B, 535.
Program 2.3.1S, 325.
x
Page 629 in Appendix C 17 Apr 2011
0
Algorithm 2.4B , 606. y 0 00
Algorithm 2.4B , 605. Algorithm 2.4B , 606.
Algorithm 2.5G, 613. y Algorithm 2.5G, 613{614.
Page 630 and following 01 Jan 2011
Mis ellaneous hanges to the existing index of Volume 1 are olle ted here,
in luding orre tions and amendments to the old entries as well as new entries
that are o asioned by the new material. Thus, the lines of the full index that
have hanged serve also as an index to the present do ument. However, when
a orre tion or amendment has aused an old index entry to be deleted, the
deletion is usually not indi ated.

 ( ir le ratio), as \random" example, Floating point arithmeti , 131, 230,

397, 591. 306, 411.
Bernstein, Sergei Natanovi h (Bernxten, Fraenkel, Aviezri Siegmund (LWPXT
Serge Natanoviq), 104. IXFRIA), 251.
Brightwell, Graham Ri hard, 547. Fuller, John Edward, xi.
Carroll, Lewis (= Dodgson, Charles Geek art, xx.
Lutwidge), 465. GO button of MIX, 126, 139, 143{144, 211.
Chebyshev (= Ts hebys he), Pafnutii Gordon, Peter Stuart, xi.
Lvovi h (Qebyxev, Pafnut Greedy algorithm, 489.
L~voviq = Qebyxev, Pafnuti Hamel, Georg Karl Wilhelm, 480.
L~voviq), inequalities, 98, 104, 472. Huskey, Harry Douglas, 229.
Chia, Hsien ( ), 53. IBM Corporation, 457.
Choi e, axiom of, 469. Invariants, 2, 17.
Comfort, Webb Tyler, 461. Kinkelin, Georg David Hermann, 504.
Contour integration, 49, 92. Knuth, Nan y Jill Carter ( ), x, xx.
Depth of node in a tree, see Level. Konigsberg bridges, 374.
Diagrams of stru tural information, Lagrange, Joseph Louis (= Giuseppe
tree stru tures, 309{315, 337, 346, Lodovi o Lagrangia = Giuseppe
349, 460, 465. Ludovi o (= Luigi) De la Grange
Digitek Corporation, 457. Tournier), inversion formula, 392, 594.
Dodgson, Charles Lutwidge, see Carroll. Lame, Gabriel, 407.
Doolittle, Myri k Has all, 303. Leaf of tree, 308, see Terminal node
e (base of natural logarithms), 23, of a tree.
619{620, 626. Lenormand, Claude, 527.
Empty list, 244{245, 247, 258, 260{261, Levy, Paul Pierre, 363.
273{275, 278, 280, 540, 546. Lilius, Aloysius (= Aloigi Giglio, Luigi
Euler, Leonhard (Eler, Leonard Lilio), 159.
= ler, Leonard), 49, 50, 52, Lineal hart, 310{311, 465.
57, 75, 76, 87, 111, 374, 407, 472, log (without subs ript), 110.
493, 496, 536, 600. Markov, Andrei Andreevi h (Markov,
Family trees, 310{311, 317, 406, 465. Andre Andreeviq), the younger, 9.
Flet her, William Thomas, 527. M Call's Cook Book, v.
14 CHANGES TO VOLUME 1: FUNDAMENTAL ALGORITHMS

Mealy, George Henry, II, 462. Staver, Tor Bhm, 582.

Mirsky, Leon (Mirski, Leonid), 587. Stirling numbers, 66{69, 71{74, 78, 99{100,
Neumann, John von (= Neumann Janos 506, 582, 591, 625.
Lajos = Margittai Neumann Janos), sup: Supremum, least upper bound, 37.
18, 229, 231, 457. Swift, Jonathan, 630.
Nonnegative oeÆ ients, 396, 501. Szpilrajn (later Mar zewski), Edward, 268.
Number system, de imal, 21, 619. Terminal node of a tree, 308, 318, 352,
OEIS R : The On-Line En y lopedia of 397, 589, 597.
Integer Sequen es R (oeis.org). Tetali, Venkata Sitarama Vara Prasad
Oldenburg, Henry (= Heinri h), 57. (ŽV V€ Þ k €G Q n„ 
Vge n X” ), 547.
€ k€ g€ ā€ 
Over ow toggle of MIX, 126, 131, 134, Trees, diagrams of, 309{315, 337, 346,
142, 144, 208, 214, 228. 349, 460, 465.
Pak, Igor Markovi h (Pak, Igor~ Tru o, Ernesto, 23.
Markoviq), 407. Vi torius of Aquitaine, 518.
Pattern mat hing, 8. von Neumann, John (= Neumann Janos
Pedigree, 310{312, 465. Lajos = Margittai Neumann Janos),
Pi (), as \random" example, 397, 591. 18, 229, 231, 457.
Reingold, Edward Martin (CLEBPIIX, Wahid Aziz Abdel-Malek, George
MIIG OA DYN WGVI), 518. (½ÀÌ¿m ‹q« ‘Ú‘« ‹Ûƒ× ,ŽØ-), 509.
Residue theorem, 472{473. Ward, Martin Paul, 576.
Reversion storage, 229, 240. Windley, Peter Fran is, 523.
Ze kendorf, E  douard, 495.
Ri e, Stephen Oswald, 565.
Root of a tree, 308, 309, 317, 465. Zedan, Hussein Saleh Mamoud
S hwenk, Allen John Carl, 495. (Îm‹Ú ŠØÌ„Ë …¿n› Ñ۔ƒ), 576.