The Art of Computer Programming: Volume 3: Sorting and Searching, 2/e (Hardcover)
Donald E. Knuth
- 出版商: Addison-Wesley Professional
- 出版日期: 1998-05-04
- 定價: USD $79.99
- 售價: $2,800
- 貴賓價: 9.5 折 $2,660
- 語言: 英文
- 頁數: 800
- 裝訂: Hardcover
- ISBN: 0201896850
- ISBN-13: 9780201896855
立即出貨 (庫存 < 3)
貴賓價: $2,660The Art of Computer Programming VOL.2 Seminumerical Algorithms, 3/e (Hardcover)
貴賓價: $2,660The Art of Computer Programming, Volume 1: Fundamental Algorithms, 3/e (Hardcover)
貴賓價: $855The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions
售價: $800The Art of Computer Programming, Volume 4, Fascicle 4 : Generating All Trees--History of Combinatorial Generation
售價: $800The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations
貴賓價: $760The Art of Computer Programming, Volume 1, Fascicle 1: MMIX -- A RISC Computer for the New Millennium (Paperback)
貴賓價: $2,660The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1 (Hardcover)
貴賓價: $903The Art of Computer Programming, Volume 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions
貴賓價: $855The Art of Computer Programming, Volume 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams (Paperback)
貴賓價: $1,829Code Complete: A Practical Handbook of Software Construction, 2/e (Paperback)
貴賓價: $1,558Introduction to Algorithms, 3/e (IE-Paperback)
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.
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.
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.
The first revision of this third volume is the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and small databases and internal and external memories. The book contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency. Outstanding features of the second edition include a revised section on optimum sorting and new discussions of the theory of permutations and of universal hashing.
Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP),http://msp.org