![](https://image.librarything.com/pics/fugue21/magnifier-left.png)
![The Art of Computer Programming, Vol. 1:…](https://images-na.ssl-images-amazon.com/images/P/0201896834.01._SX180_SCLZZZZZZZ_.jpg)
Auf ein Miniaturbild klicken, um zu Google Books zu gelangen.
Lädt ... The Art of Computer Programming, Vol. 1: Fundamental Algorithms, 3rd Edition (Original 1968; 1997. Auflage)von Donald E. Knuth (Autor)
Werk-InformationenThe Art of Computer Programming Volume 1 von Donald E. Knuth (1968)
![]() Keine aktuelle Diskussion zu diesem Buch. ![]() ![]() Indeholder "Preface", "Preface to the Second Edition", "Procedure for Reading This Set of Books", "Notes on the Exercises", "Chapter 1. Basic Concepts", " 1.1. Algorithms", " 1.2. Mathematical Preliminaries", " 1.2.1. Mathematical Induction", " 1.2.2. Numbers, Powers, and Logarithms", " 1.2.3. Sums and Products", " 1.2.4. Integer Functions and Elementary Number Theory", " 1.2.5. Permutations and Factorials", " 1.2.6. Binomial Coefficients", " 1.2.7. Harmonic Numbers", " 1.2.8. Fibonacci Numbers", " 1.2.9. Generating Functions", " 1.2.10. Analysis of an Algorithm", " 1.2.11* Asymptotic Representations", " 1.2.11.1* The O-notation", " 1.2.11.2* Euler's summation formula", " 1.2.11.3* Some asymptotic calculations", " 1.3. MIX", " 1.3.1. Description of MIX", " 1.3.2. The MIX Assembly Language", " 1.3.3. Applications to Permutations", " 1.4. Some Fundamental Programming Techniques", " 1.4.1. Subroutines", " 1.4.2. Coroutines", " 1.4.3. Interpretive Routines", " 1.4.3.1. A MIX simulator", " 1.4.3.2* Trace routines", " 1.4.4. Input and Output", " 1.4.5. History and Bibliography", "Chapter 2 Information Structures", " 2.1. Introduction", " 2.2. Linear Lists", " 2.2.1. Stacks, Queues, and Deques", " 2.2.2. Sequential Allocation", " 2.2.3. Linked Allocation", " 2.2.4. Circular Lists", " 2.2.5. Doubly Linked Lists", " 2 2.6. Arrays and Orthogonal Lists", " 2.3. Trees", " 2.3.1. Traversing Binary Trees", " 2.3.2. Binary Tree Representation of Trees", " 2.3.3. Other Representations of Trees", " 2.3.4. Basic Mathematical Properties of Trees", " 2.3.4.1. Free trees", " 2.3.4.2. Oriented trees", " 2.3.4.3* The "infinity lemma"", " 2.3.4.4* Enumeration of trees", " 2.3.4.5. Path length", " 2.3.4.6* History and bibliography", " 2.3.5. Lists and Garbage Collection", " 2.4. Multilinked Structures", " 2.5. Dynamic Storage Allocation", " 2.6. History and Bibliography", "Answers to Exercises", "Appendix A. Index to Notations", "Appendix B. Tables of Numerical Quantities", " 1. Fundamental Constants (decimal)", " 2. Fundamental Constants (octal)", " 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers", "Index and Glossary". En total klassiker indenfor datalogi. Knuth viser vejen og vejen er ikke altid let, men det er Vejen! There aren't enough stars to rate this. My only regret (and it's a minor one) is that I don't have my old copies, which I gave to a friend when I bought the new and updated ones. The old ones fell open at certain pages, and this volume (and its two companions are new), and will never see the use of the others. I see that there's a Volume 4A, but I'm not really sure that it makes sense for me to get it, at this stage in life. Donald Knuth is one of my heroes. If you program and you don't know this book, and its companion volumes 2 and 3, it's like saying you live in San Francisco and haven't seen the Golden Gate Bridge. The books are really much more valuable to someone with a knowledge of calculus, and some discrete mathematics. If you are looking for programming cookbooks, don't go here, but if you want to know why binary trees, stacks and queues are used, and who thought of their use first, and their history of development, then read these books. The above is, of course, a gross simplification. You will also learn how to properly analyze an algorithm - how to design algorithms to compute arithmetic results to achieve the minimum amount of error, how to design a proper random number generator - how to choose the right datastructure for search operations, etc.. More to the point, you will gain the skills to answer such questions on your own. And most of all, you will see, once again, that the very brightest people are humble and have a sense of humor. The places where this book made me laugh out loud are too numerous to count. keine Rezensionen | Rezension hinzufügen
Gehört zur ReiheGehört zu Verlagsreihen
Literaturhinweise zu diesem Werk aus externen Quellen.
|
Aktuelle DiskussionenKeineBeliebte Umschlagbilder
![]() GenresMelvil Decimal System (DDC)005.1Information Computer Science; Knowledge and Systems Computer programming, programs, data, security ProgrammingKlassifikation der Library of Congress [LCC] (USA)BewertungDurchschnitt:![]()
Bist das du?Werde ein LibraryThing-Autor. |