The Art of Computer Programming, Volume 2: Seminumerical Algorithms (2nd Edition) [Hardcover]

Donald E. Knuth (Author)

Book Description

ISBN-10: 0201038226 | ISBN-13: 978-0201038224 | Publication Date: January 1981 | Edition: 2nd

Third Edition now available!Volume 2 provides a comprehensive interface between computer programming and numerical analysis. It includes a substantial amount of complexity theory, number theory, and statistics. 0201038226B04062001

Editorial Reviews

From the Back Cover

Third Edition
now available! Volume 2 provides a comprehensive interface between computer programming and numerical analysis. It includes a substantial amount of complexity theory, number theory, and statistics. 0201038226B04062001

About the Author

Donald E. Knuth is known throughout the world for his pioneering work on algorithms and programming techniques, for his invention of the Tex and Metafont systems for computer typesetting, and for his prolific and influential writing. Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of these fascicles and the seven volumes to which they belong.

Product Details

• Hardcover: 704 pages
• Publisher: Addison-Wesley Pub (Sd); 2nd edition (January 1981)
• Language: English
• ISBN-10: 0201038226
• ISBN-13: 978-0201038224
• Product Dimensions: 9.5 x 6.4 x 1.5 inches
• Shipping Weight: 2.4 pounds
• Average Customer Review: 4.5 out of 5 stars  See all reviews (4 customer reviews)
• Amazon Best Sellers Rank: #1,798,136 in Books (See Top 100 in Books)

Customer Reviews

Most Helpful Customer Reviews

17 of 19 people found the following review helpful:

5.0 out of 5 stars Can we shave a constant off this running time?, April 3, 1998

By A Customer

This review is from: The Art of Computer Programming, Volume 2: Seminumerical Algorithms (2nd Edition) (Hardcover)

To an ordinary computer scienist, an algorithm is polynomial-time. To Knuth, it takes 3*n^2 + 17*x + 5 steps on MIX, not counting the time required to display the output, but there might be a way to reduce the number of steps to 3*n^2 + 17*x + 4. For precision and rigor, the Art of Computer Programming books are hard to beat. But, at least for an undergraduate CS student like me, they are slow going. Their greatest value seems to be as a reference for mathematical ideas needed in analysis of algorithms: recurrence relations, combinatorial identities, etc. Like the Bible, the TAOCP books are good to have around even if you don't plan to read them.

9 of 12 people found the following review helpful:

4.0 out of 5 stars Difficult book, great source for exercises., April 1, 1998

By A Customer

This review is from: The Art of Computer Programming, Volume 2: Seminumerical Algorithms (2nd Edition) (Hardcover)

Knuth's presentation is obscure and difficult, but he's awfully comprehensive. If you want to learn algorithms, or even if you're looking for a reference, there are many better choices (especially Introduction to Algorithms, the CLR book). That said, I can't point to a more thorough book. Among other things, The Art of Computer Programming series is a great source of problems if you're teaching, learning, or just looking for fun. It might be worth the price just for that.

7 of 10 people found the following review helpful:

4.0 out of 5 stars Well, it's Knuth, March 25, 1998

By A Customer

This review is from: The Art of Computer Programming, Volume 2: Seminumerical Algorithms (2nd Edition) (Hardcover)

These volumes are considered first-class references on the subject of computing and algorithms. And they are... but these aren't really books to read. Nobody has time for that. However, for those computer scientists that really are hard up for something to read one of those rainy nights, Knuth has a personal flair and humor that spills into his algorithm summaries and exercises that is unsurpassed, at least in the field of CS handbooks. An excellent source for solutions to commonly asked questions and problems.