add prompts and knowledge files
This commit is contained in:
parent
2e8d482940
commit
18c36419dc
16 changed files with 516 additions and 0 deletions
15
data/knowledge/taocp.txt
Normal file
15
data/knowledge/taocp.txt
Normal file
|
|
@ -0,0 +1,15 @@
|
|||
The Art of Computer Programming by Donald E. Knuth. Multi-volume work on algorithms and programming.
|
||||
Volume 1: Fundamental Algorithms covers basic concepts data structures and mathematical preliminaries.
|
||||
Volume 2: Seminumerical Algorithms covers random number generation and arithmetic.
|
||||
Volume 3: Sorting and Searching covers sorting algorithms like quicksort merge sort heap sort.
|
||||
Volume 4A: Combinatorial Algorithms covers combinatorial searching and backtracking.
|
||||
Knuth developed the concept of literate programming where programs are written as works of literature.
|
||||
The book uses MIX an abstract machine architecture that Knuth designed for teaching.
|
||||
Later editions replaced MIX with MMIX a modern RISC architecture.
|
||||
Knuth offers a reward for finding errors in his books starting at 2.56 and doubling each year.
|
||||
The books are known for their rigorous mathematical analysis of algorithm complexity.
|
||||
Knuth created TeX and METAFONT for typesetting mathematical and technical documents.
|
||||
Analysis of algorithms uses O notation for asymptotic upper bounds and Theta for tight bounds.
|
||||
The study of algorithms is the foundation of computer science and software engineering.
|
||||
Algorithm analysis considers time complexity space complexity and optimality proofs.
|
||||
Sorting networks permutation generation and tree structures are fundamental data organization methods.
|
||||
Loading…
Add table
Add a link
Reference in a new issue