Errata for `Combinatorial Algorithms{ for Computers

and Cal ulators'

Albert Nijenhuis and Herbert S. Wilf
September 1, 2006

 page 33, line 3:

Repla e
by

1  A(1) < A(2) : : :  A(N )

1  A(1) < A(2) : : :  A(K )  A(N )

 page 49, line 19:

Repla e \measuring" by \reasoning".

 page 57, line 8:

Repla e \4,5,6" by \5,6,7".

 page 75, line -1:

\partition of I " should be \partitions of I ".

 page 83:

Repla e

by

3 10 11
10 00

00 001 000
01 000 000
000 100

0 1 0 1
 10   11   00  001
000
;B
000 C
(3);
;
;
;B
000 C
A

A

10
00
01
000
100
1

 page 105, line 20:

Repla e \2  0" by \2  2".

 page 105, line 22:

Repla e \ =  = 1" by \  2 ".

 page 115:

Under RANK 2, EDGE repla e \01101" by \01100".

Column under NU should be
333210
332210
332110
332100
322210
322110
322100
321110
321100
321000
line -2:
Repla e \1)(25)(34)" by \(1)(25)(34)".
 page 126, line -8:

Repla e \u.a.r.a" by \u.a.r. a".

 page 128, line -5:

Repla e \Approximate number" by \Number".

 page 131, line 1:

Repla e \LAN(I) + 1 + J" by \LAN(I) + I + J".

 page 168, line 12:

Move \Q = X(I)" to normal indentation.

 pages 168,169:

Ignore the program omment lines that ontain the phrase \FROM WHERE TO"
2

 page 183, line 1:

Repla e \just" by \G ".

0

 page 192, line -5:

Repla e \C(J)" by \C(J+Q)".

 page 197, line 6:

Repla e \z 2 S " by \z 2= S ".

line 13
Repla e \Kir ho" by \Kir hho".
 page 224, between lines -7 and -6:

Insert \MTC = .False.".

 page 287, line 1:

Repla e \ apitols" by \ apitals".

 page 299, line -7:

Repla e \polinomial" by \polynomial".