Customer Reviews

Handbook of Algorithms and Data Structures in Pascal and C

5 star:		(1)
4 star:		(0)
3 star:		(1)
2 star:		(0)
1 star:		(0)

 

 

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.

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.