taocp

working through the Art of Computer Programming

The BOOK

Volumne 1-4B

• Homepage
• Booksite from the publisher

Pre-fascicles

Pre-fascicle	Content
7a	Constraint Satisfaction
8a	Hamiltonian Paths and Cycles
8b	Cliques
9b	A Potpourri of puzzles
9c	Estimating backtrack costs
12a	Components and traversal
14a	Bipartite Matching
20a	Introduction to recursion

Chapter 1

Chapter 2

• 2.2.5: Knuth's Elevator Simulator
  • C++ Implementation
  • Go Implementation
  • Relevant Discussion on HN

Chapter 5

5.2.3 Sorting by Selection

• Ex 36.
  • Leetcode practice
  • OrderedDict: OrderedDict uses the same implementation as Knuth mentioned in the solution.

Chapter 7

7.1.3 Bitwise tricks and techniques

• Gosper's Hack: Exercises 20, 21, 22.
  • Python code

7.2.2.2 Satisfiability

• SAT/SMT by Example contains many answers for exercises of this section, focusing on using SMT/SAT solvers to formulate the problems.

Christmas Tree Lecture

• Dancing Cells (2023)

Misc

• Ask HN: Is Knuth's TAOCP worth the time and effort? (2023)
• Ask HN: Is Knuth's TAOCP worth the time and effort? (2016)