|
An Introduction to the Analysis of Algorithms
 |
Author: Robert Sedgewick, Philippe Flajolet
List Price: $57.99
Our Price: Click to see the latest and low price
ISBN: 020140009X
Publisher: Addison-Wesley Pub Co (30 November, 1995)
Edition: Hardcover
Sales Rank: 117,712
Average Customer Rating: 4.8 out of 5
|
Customer ReviewsRating: 4 out of 5
Not a reference guide
This book is REALLY for coursework : someone who is going to sit down and read and work thru this book sequentially, not randomly like a reference book.
Other than that caveat it does what it promises ably but be aware that it is MATHS heavy and REQUIRES the programme work.
Rating: 5 out of 5
A must have.
I read a lot of books about complexity analysis. And this book is a state of art in the field. Easy to read, and well done.It cover the necessary staff that every new commer to the field should know, can be used as a refference,and it make a good teaching material for graduate student.
Rating: 5 out of 5
Clear and concise
This is an excellent book on the analysis of algorithms. More specifically, it is a book on the mathematics needed for the analysis of algorithms. Quite a few algorithms are presented and analyzed in great detail, but the emphasis is on the analysis techniques rather than on the algorithms.This is in contrast with Cormen,Leiserson and Rivest, or Sedgewick's own "Algorithms" series which emphasize the algorithms rather than the analysis. If you're looking for a catalog of algorithms along with explanations, you want a different book, but if you want to know how to analyze that bizarre code (which Fred in the next cubicle wrote) and prove that it works well (or doesn't) then this is an excellent choice. The book is aimed at advanced undergrads/graduate students and assumes a certain amount of mathematical sophistication - i.e. calculus, discrete math, probability, etc. On the spectrum from "Mathematical Techniques" through "Analysis of Algorithms" and ending up with "Catalog of Algorithms", I would start with Graham, Knuth and Patashnik "Concrete Mathematics", travel through this book, on to Knuth "The Art of Computer Programming", then to Cormen, Leiserson and Rivest, and finally end up with either Sedgewick's "Algorithms" or Skeina's "Algorithm Design Manual".
Similar Products
· Programming Pearls (2nd Edition)
· Introduction to the Theory of Computation
· Introduction to Algorithms, Second Edition
· Concrete Mathematics: A Foundation for Computer Science (2nd Edition)
· The Design and Analysis of Computer Algorithms
|
