{"id":23826448,"url":"https://github.com/dangkhoasdc/taocp","last_synced_at":"2026-02-10T21:33:14.149Z","repository":{"id":161125290,"uuid":"617987683","full_name":"dangkhoasdc/taocp","owner":"dangkhoasdc","description":"working through the Art of Computer Programming","archived":false,"fork":false,"pushed_at":"2026-01-15T15:13:15.000Z","size":37039,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2026-01-15T19:00:53.216Z","etag":null,"topics":["algorithms","analysis-of-algorithms","data-structures","programming"],"latest_commit_sha":null,"homepage":"","language":"Julia","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/dangkhoasdc.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2023-03-23T14:22:19.000Z","updated_at":"2026-01-15T15:13:22.000Z","dependencies_parsed_at":null,"dependency_job_id":"b4eab334-f74f-431f-a140-cbec0b7720a0","html_url":"https://github.com/dangkhoasdc/taocp","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/dangkhoasdc/taocp","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dangkhoasdc%2Ftaocp","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dangkhoasdc%2Ftaocp/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dangkhoasdc%2Ftaocp/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dangkhoasdc%2Ftaocp/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dangkhoasdc","download_url":"https://codeload.github.com/dangkhoasdc/taocp/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dangkhoasdc%2Ftaocp/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29317956,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-10T20:44:44.282Z","status":"ssl_error","status_checked_at":"2026-02-10T20:44:43.393Z","response_time":65,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","analysis-of-algorithms","data-structures","programming"],"created_at":"2025-01-02T12:20:30.142Z","updated_at":"2026-02-10T21:33:14.130Z","avatar_url":"https://github.com/dangkhoasdc.png","language":"Julia","funding_links":[],"categories":[],"sub_categories":[],"readme":"# taocp\nworking through the Art of Computer Programming\n\n# The BOOK\n\n## Volumne 1-4B\n- [Homepage](https://www-cs-faculty.stanford.edu/~knuth/taocp.html)\n- [Booksite from the publisher](https://www.informit.com/store/art-of-computer-programming-volumes-1-4b-boxed-set-9780137935109)\n\n## Pre-fascicles\n|Pre-fascicle|Content|\n|------------|-------|\n|7a | [Constraint Satisfaction](pre-fascicles/fasc7a.pdf) |\n|8a | [Hamiltonian Paths and Cycles](pre-fascicles/fasc8a.pdf) |\n|8b | [Cliques](pre-fascicles/fasc8b.pdf) |\n|9b | [A Potpourri of puzzles](pre-fascicles/fasc9b.pdf) |\n|9c | [Estimating backtrack costs](pre-fascicles/fasc9c.pdf) |\n|12a| [Components and traversal](pre-fascicles/fasc12a.pdf) |\n|14a| [Bipartite Matching](pre-fascicles/fasc14a.pdf) |\n|20a| [Introduction to recursion](pre-fascicles/fasc20a.pdf) |\n\n# Chapter 1\n# Chapter 2\n- 2.2.5: Knuth's Elevator Simulator \n  - [C++ Implementation](https://github.com/Quuxplusone/KnuthElevator/tree/main)\n  - [Go Implementation](https://github.com/meatfighter/knuth-elevator)\n  - [Relevant Discussion on HN](https://news.ycombinator.com/item?id=27778210)\n\n# Chapter 5\n### 5.2.3 Sorting by Selection\n- Ex 36. \n  - [Leetcode practice](https://leetcode.com/problems/lru-cache/)\n  - [OrderedDict](https://docs.python.org/3/library/collections.html#collections.OrderedDict): `OrderedDict` uses the same implementation as Knuth mentioned in the solution.\n  \n# Chapter 7\n### 7.1.3 Bitwise tricks and techniques\n- [Gosper's Hack](https://read.seas.harvard.edu/~kohler/class/cs207-s12/lec12.html): Exercises 20, 21, 22. \n    - [Python code](https://github.com/alussana/TrieSUS/blob/bbfd1a7579f9fb321e6f47d73e38a3eea59aa49e/triesus/naive_sus.py#L4)\n#### 7.2.2.2 Satisfiability\n- [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.\n\n# Christmas Tree Lecture\n- [Dancing Cells (2023)](https://www.youtube.com/watch?v=622iPkJfYrI\u0026ab_channel=StanfordOnline)\n\n# Misc\n\n- [Ask HN: Is Knuth's TAOCP worth the time and effort? (2023)](https://news.ycombinator.com/item?id=38443668)\n- [Ask HN: Is Knuth's TAOCP worth the time and effort? (2016)](https://news.ycombinator.com/item?id=10897460)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdangkhoasdc%2Ftaocp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdangkhoasdc%2Ftaocp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdangkhoasdc%2Ftaocp/lists"}