Art of Computer Programming, The: Volume 3: Sorting and Searching, 2nd Edition

Index and Glossary

If you don’t find it in the Index, look very carefully through the entire catalogue.

— SEARS, ROEBUCK AND CO., Consumers Guide (1897)

When an index entry refers to a page containing a relevant exercise, see also the answer to that exercise for further information. An answer page is not indexed here unless it refers to a topic not included in the statement of the exercise.

• ⇔: If and only if.

• −∞, 4, 142–144, 156, 214, 663–664, 685, 707.

• 0–1 matrices, 660.

• 0–1 principle, 223, 224, 245, 667, 668.

• 1/3–2/3 conjecture, 197.

• 2–3 trees, 476–477, 480, 483, 715.

• (2, 4)-trees, 477.

• 2-d trees, 565.

• 2-descending sequence, 451.

• 2-ordered permutations, 86–88, 103, 112–113, 134.

• 80–20 rule, 400–401, 405, 456.

• ∞, 4, 138–139, 257–258, 263