https://github.com/dangkhoasdc/taocp

working through the Art of Computer Programming
https://github.com/dangkhoasdc/taocp

algorithms analysis-of-algorithms data-structures programming

Last synced: 12 days ago
JSON representation

working through the Art of Computer Programming

• Host: GitHub
• URL: https://github.com/dangkhoasdc/taocp
• Owner: dangkhoasdc
• Created: 2023-03-23T14:22:19.000Z (almost 2 years ago)
• Default Branch: main
• Last Pushed: 2025-01-01T15:18:29.000Z (13 days ago)
• Last Synced: 2025-01-01T16:26:49.667Z (13 days ago)
• Topics: algorithms, analysis-of-algorithms, data-structures, programming
• Language: Julia
• Homepage:
• Size: 29.2 MB
• Stars: 2
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# 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) |

# Chapter 1

# 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.1.3 Bitwise tricks and techniques

- [Gosper's Hack](https://read.seas.harvard.edu/~kohler/class/cs207-s12/lec12.html): Exercises 20, 21, 22. 

    - [Python code](https://github.com/alussana/TrieSUS/blob/bbfd1a7579f9fb321e6f47d73e38a3eea59aa49e/triesus/naive_sus.py#L4)

#### 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.

# Christmas Tree Lecture

- [Dancing Cells (2023)](https://www.youtube.com/watch?v=622iPkJfYrI&ab_channel=StanfordOnline)

# 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)