Handbook of Algorithms and Data Structures in Pascal and C (Paperback)

~ Gaston H. Gonnet (Author), R. Baeza-Yates (Editor), Gaston Gonnet (Author), Ricardo Baeza-Yates (Author)

Editorial Reviews

Product Description

This second edition brings together many useful algorithms and their associated data structures in a single, handy reference, featuring a new section on text manipulation algorithms and expanded coverage of arithmetical algorithms. Each algorithm is coded in both C and Pascal.

Product Details

• Paperback: 424 pages
• Publisher: Addison-Wesley Pub (Sd); 2nd edition (May 1991)
• Language: English
• ISBN-10: 0201416077
• ISBN-13: 978-0201416077
• Product Dimensions: 9.8 x 7.2 x 1 inches
• Shipping Weight: 1.8 pounds
• Average Customer Review: 4.0 out of 5 stars  See all reviews (2 customer reviews)
• Amazon.com Sales Rank: #1,759,422 in Books (See Bestsellers in Books)

  Popular in this category: (What's this?)

  #28 in

  Books > Computers & Internet > Programming > C > Algorithms

Customer Reviews

Most Helpful Customer Reviews

14 of 14 people found the following review helpful:

5.0 out of 5 stars An excellent reference for the professional, February 24, 1998

By A Customer

Both this book and the preceding (smaller) edition have earned their place on my reference shelf. More up to date than Knuth's 2nd edition and covering much broader territory than (for example) Samet's D&A of Spatial Data Structures, I've found a number of algorithms and data structures in this text that have been directly applicable to my work as a systems programmer.

One of the major features of this book is, where possible, the consistent presentation and comparison of expected running times under a variety of input data conditions, with both theoretical and empirical results.

A very browseable handbook. Not one of the hundreds of 1st year textbooks. It's a shame that it's out of print.

2 of 2 people found the following review helpful:

3.0 out of 5 stars Wonderful, but dated, January 14, 2008

By	Matthew Leo "grumpynerd" (Boston, MA) - See all my reviews (REAL NAME)

This was a great cookbook for the kinds of things algorithms that were most important in the early 90s. Computer science has not necessarily advanced that much in the last twenty years, but computer applications have. Most people had never heard of the Internet in 1991; that one development alone makes a whole new universe of applications and algorithms interesting.

If this book had been updated (which it sadly has not), it might have a lot more optimization, cryptographic, pattern matching and graph theoretic content. If this were 1991, this book would get 5 stars. In 2008, it gets three: it's still useful, but not a must have.