文件列表:

conmath/ (0, 2023-12-11)
download.sh (394, 2023-12-11)
pre-fascicles/ (0, 2023-12-11)
pre-fascicles/fasc12a.pdf (579176, 2023-12-11)
pre-fascicles/fasc14a.pdf (420726, 2023-12-11)
pre-fascicles/fasc16a.pdf (202619, 2023-12-11)
pre-fascicles/fasc20a.pdf (203817, 2023-12-11)
pre-fascicles/fasc7a.pdf (2327117, 2023-12-11)
pre-fascicles/fasc8a.pdf (741014, 2023-12-11)
pre-fascicles/fasc8b.pdf (198757, 2023-12-11)
pre-fascicles/fasc9b.pdf (722965, 2023-12-11)
pre-fascicles/fasc9c.pdf (501027, 2023-12-11)
taocp/ (0, 2023-12-11)
taocp/ch1/ (0, 2023-12-11)
taocp/ch1/euclid.jl (701, 2023-12-11)

# taocp working through the Art of Computer Programming # The BOOK ## Volumne 1-4B - [Homepage](https://www-cs-faculty.stanford.edu/~knuth/taocp.html) - [Booksite from the publisher](https://www.informit.com/store/art-of-computer-programming-volumes-1-4b-boxed-set-9780137935109) ## Pre-fascicles |Pre-fascicle|Content| |------------|-------| |7a | [Constraint Satisfaction](pre-fascicles/fasc7a.pdf) | |8a | [Hamiltonian Paths and Cycles](pre-fascicles/fasc8a.pdf) | |8b | [Cliques](pre-fascicles/fasc8b.pdf) | |9b | [A Potpourri of puzzles](pre-fascicles/fasc9b.pdf) | |9c | [Estimating backtrack costs](pre-fascicles/fasc9c.pdf) | |12a| [Components and traversal](pre-fascicles/fasc12a.pdf) | |14a| [Bipartite Matching](pre-fascicles/fasc14a.pdf) | |20a| [Introduction to recursion](pre-fascicles/fasc20a.pdf) | # Code ## Chapter 2 - 2.2.5: Knuth's Elevator Simulator - [C++ Implementation](https://github.com/Quuxplusone/KnuthElevator/tree/main) - [Go Implementation](https://github.com/meatfighter/knuth-elevator) - [Relevant Discussion on HN](https://news.ycombinator.com/item?id=27778210) ## Chapter 5 ### 5.2.3 Sorting by Selection - Ex 36. - [Leetcode practice](https://leetcode.com/problems/lru-cache/) - [OrderedDict](https://docs.python.org/3/library/collections.html#collections.OrderedDict): `OrderedDict` uses the same implementation as Knuth mentioned in the solution. ## Chapter 7 ### 7.2.2.2 Satisfiability - [SAT/SMT by Example](https://smt.st) contains many answers for exercises of this section, focusing on using SMT/SAT solvers to formulate the problems. # Misc - [Ask HN: Is Knuth's TAOCP worth the time and effort? (2023)](https://news.ycombinator.com/item?id=38443668) - [Ask HN: Is Knuth's TAOCP worth the time and effort? (2016)](https://news.ycombinator.com/item?id=10897460)

近期下载者：

相关文件：

评论：[我要评论] [举报此文件]

收藏者：