- Restposten! - Jetzt zugreifen solange Vorrat reicht! Mehr englische Restposten.
Andere Verkäufer auf Amazon
+ kostenlose Lieferung
+ kostenlose Lieferung
+ kostenlose Lieferung
The Art of Computer Programming 1. Fundamental Algorithms (ART OF COMPUTER PROGRAMMING VOLUME 1) (Englisch) Gebundenes Buch – 7. Juli 1997
|Neu ab||Gebraucht ab|
Hinweise und Aktionen
Wird oft zusammen gekauft
Kunden, die diesen Artikel gekauft haben, kauften auch
Es wird kein Kindle Gerät benötigt. Laden Sie eine der kostenlosen Kindle Apps herunter und beginnen Sie, Kindle-Bücher auf Ihrem Smartphone, Tablet und Computer zu lesen.
Geben Sie Ihre Mobiltelefonnummer ein, um die kostenfreie App zu beziehen.
Wenn Sie dieses Produkt verkaufen, möchten Sie über Seller Support Updates vorschlagen?
This magnificent tour de force presents a comprehensive overview of a wide variety of algorithms and the analysis of them. Now in its third edition, The Art of Computer Programming, Volume I: Fundamental Algorithms contains substantial revisions by the author and includes numerous new exercises.
Although this book was conceived several decades ago, it is still a timeless classic. One of the book's greatest strengths is the wonderful collection of problems that accompany each chapter. The author has chosen problems carefully and indexed them according to difficulty. Solving a substantial number of these problems will help you gain a solid understanding of the issues surrounding the given topic. Furthermore, the exercises feature a variety of classic problems.
Fundamental Algorithms begins with mathematical preliminaries. The first section offers a good grounding in a variety of useful mathematical tools: proof techniques, combinatorics, and elementary number theory. Knuth then details the MIX processor, a virtual machine architecture that serves as the programming target for subsequent discussions. This wonderful section comprehensively covers the principles of simple machine architecture, beginning with a register-level discussion of the instruction set. A later discussion of a simulator for this machine includes an excellent description of the principles underlying the implementation of subroutines and co-routines. Implementing such a simulator is an excellent introduction to computer design.
In the second section, Knuth covers data structures--stacks, queues, lists, arrays, and trees--and presents implementations (in MIX assembly) along with techniques for manipulating these structures. Knuth follows many of the algorithms with careful time and space analysis. In the section on tree structures, the discussion includes a series of interesting problems concerning the combinatorics of trees (counting distinct trees of a particular form, for example) and some particularly interesting applications. Also featured is a discussion of Huffmann encoding and, in the section on lists, an excellent introduction to garbage collection algorithms and the difficult challenges associated with such a task. The book closes with a discussion of dynamic allocation algorithms.
The clear writing in Fundamental Algorithms is enhanced by Knuth's dry humor and the historical discussions that accompany the technical matter. Overall, this text is one of the great classics of computer programming literature--it's not an easy book to grasp, but one that any true programmer will study with pleasure.
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 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 If you think you're a really good programmer...read [Knuth's] Art of Computer Programming...You should definitely send me a resume if you can read the whole thing. --Bill Gates 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 This first volume in the series begins with basic programming concepts and techniques, then focuses more particularly on information structures--the representation of information inside a computer, the structural relationships between data elements and how to deal with them efficiently.Elementary applications are given to simulation, numerical methods, symbolic computing, software and system design.Dozens of simple and important algorithms and techniques have been added to those of the previous edition. The section on mathematical preliminaries has been extensively revised to match present trends in research. Alle Produktbeschreibungen
Kunden, die diesen Artikel angesehen haben, haben auch angesehen
Derzeit tritt ein Problem beim Filtern der Rezensionen auf. Bitte versuchen Sie es später noch einmal.
There are a lot of programmers who can write code that works but don't have any great feel for what they are doing. The best programmers understand not only what they are doing but why they are doing it that way. These are the ones who deliver the best results and this series of books can place you firmly in this camp.
The only weakness of the book isits over reliance on the author's MIX language. Certainly there are reasons for him using it but it is still a barrier for many people.
Jeder, der seine Mathematik-Kenntnisse auffrischen, seine Algorithmen verbessern und die Grundlagen von Assembler lernen möchte, dem empfehle ich dieses Buch. In jedem Fall hat man lange daran zu knabbern - Aber es lohnt sich. Müsste ich auf eine einsame Insel ziehen und dürfte nur ein Buch mitnehmen, käme Band 1 von Knuths TAoCP in die engere Auswahl.
So don't kill yourself if you're new to real programming and all this sounds arbitrary. Knuth in effect has written a clearinghouse of ideas that have come up in computer science. This book at times comes to seem like The Art of Explaining.
For those who hate the use of the MIX assembly language instead of some easier language such as C: You lose information that way. That is sufficient reason for not using C. You can't really time an algorithm using such a language (and a main reason for studying algorithms is speed) unless you carefully define the underlying hardware and C implementation... and once you do that, using C is pointless for pedagogy, since you will be using inline MIX for things that C is too general for.
And you'd really hate it if you were programming in Lisp.
There are quite a few good books on algorithms in C, though I haven't read them. If you're forced to read this book, consider changing your situation; Knuth has fallen on hard times if his text has become a torture device for some.
The updated volume 1 is more of the same - a classic revisited, revamped, restored. It is odd to handle something so familiar, yet so crisp.
Those who dislike MIX will be unimpressed - to them, I say that you don't learn by doing the same vanilla thing time and again, but rather by wrestling with unfamiliar concepts and architectures. Many times my fellow programmers will find themselves roadblocked in an unfamiliar situation, while I often can see the unobvious solution - I attribute this ability to a wide experience with unconventional solutions, including extensive study of Knuth's TAOCP.
If you're serious about your programming abilities, you *must* own (and study) this book! Frankly, if computer science were taught as an apprenticeship, this would be the journeyman's manual. I've required the many programmers I've trained over the years to own and study TAOCP, and they've all come to appreciate it's layered approach to problems - you can read Knuth at many levels, from algorithm reference to meta-analysis of an entire class of problems.
If there is a Koran, Bible, or Tao of Computer Science, this is it. The only thing close is Aho's "Dragon Book," and it's specific to compilers.