|
Dieses Buch gibt es in einer neuen Auflage:
|
Produktinformation
|
This multivolume work is widely recognized as the definitive description of classical computer science. The first three volumes have for decades been an invaluable resource in programming theory and practice for students, researchers, and practitioners alike.
The bible of all fundamental algorithms and the work that taught many of today’s software developers most of what they know about computer programming.
–Byte, September 1995
Countless readers have spoken about the profound personal influence of Knuth’s work. Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his “cookbook” solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.
I can’t begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home… and even at a Little League game when my son wasn’t in the line-up.
–Charles Long
Primarily written as a reference, some people have nevertheless found it possible and interesting to read each volume from beginning to end. A programmer in China even compared the experience to reading a poem.
If you think you’re a really good programmer… read [Knuth’s] Art of Computer Programming… You should definitely send me a résumé if you can read the whole thing.
–Bill Gates
Whatever your background, if you need to do any serious computer programming, you will find your own good reason to make each volume in this series a readily accessible part of your scholarly or professional library.
It’s always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers.
–Jonathan Laventhol
For the first time in more than 20 years, Knuth has revised all three books to reflect more recent developments in the field. His revisions focus specifically on those areas where knowledge has converged since publication of the last editions, on problems that have been solved, on problems that have changed. In keeping with the authoritative character of these books, all historical information about previous work in the field has been updated where necessary. Consistent with the author’s reputation for painstaking perfection, the rare technical errors in his work, discovered by perceptive and demanding readers, have all been corrected. Hundreds of new exercises have been added to raise new challenges.
0201485419B04062001
In den drei Bänden wird ein breites Spektrum an Algorithmen und mathematische Grundlagen behandelt: In "Fundamental Algorithms" werden typische Datenstrukturen, wie Listen oder Bäume, aber auch Techniken wie Garbage Collection genauer betrachtet. In "Seminumerical Algorithms" liegt der Schwerpunkt auf Erzeugung von Pseudozufallszahlen und Tests über deren Güte, sowie auf Arithmetik von Ganzzahlen und Gleitpunktzahlen. Im (bisher letzten) Band "Sorting and Searching" werden Such- und Sortieralgorithmen genauer betrachtet. (Weitere Bücher sind in Vorbereitung und werden hoffentlich bald folgen.)
In allen Büchern wird (mehr oder weniger) Code einer fiktiven Maschine (MIX) vorgestellt, die auch letzte Details der Algorithmen zu Tage bringt. An dieser Stelle merkt man, dass das Buch schon vor einigen Jahren geschrieben worden ist, was dem Verständnis aber keinen Abbruch tut: Die Essenz tritt trotzdem zu Tage.
Der Autor behandelt alle Themen verständlich und präzise. Allerdings sollte man mit der Mathematik nicht auf Kriegsfuß stehen: Wenn man das letzte Detail verstehen will, muss man das Buch konzentriert durcharbeiten.
Insgesamt kann man das Buch jedem empfehlen, der nicht nur Programme "hacken" möchte: Man kann ein tieferes Verständnis für Programmierung gewinnen. (Dies ist eine Amazon.de an der Uni-Studentenrezension.)
Each volume contains 2 chapters. Ch. 1, Basic Concepts: mathematical foundations and a description of MIX, a hypothetical machine (now available in software emulations). Ch. 2, Information Structures: lists, trees, memory allocation, garbage collection. Ch. 3, Random Numbers: how to produce series of "random" numbers and test their statistical properties. Ch. 4, Arithmetic: algorithms for integer and floating-point arithmetic. Ch. 5, Sorting: both in memory and on disks or tapes. Ch. 6, Searching: sequential, binary, hashing.
Despite the detailed coverage of the topics, which often involves esoteric mathematical notation, the author's lively style makes the algorithms and the main theoretical results relatively easy to grasp. If all you care about is getting a program to run, buy another book; but if you really want to understand how and why software works, there's nothing quite like this.
|
Das Forum zu diesem Produkt
Fragen stellen, Meinungen austauschen, Einblicke gewinnen Aktive Diskussionen in ähnlichen Foren
Kundendiskussionen durchsuchen
|
Ähnliche Foren
|
||||||||||||||||||||||||||||||||||
|
|