Order from a Major Online Bookstore
Ultimate Book Price Comparison Engine
Save Your Time And Money
| AnyBook4Less.com | Order from a Major Online Bookstore |
|
| Home | Store List | FAQ | Contact Us | | ||
| Ultimate Book Price Comparison Engine Save Your Time And Money |
||
 |
Title: An Introduction to the Analysis of Algorithms by Robert Sedgewick, Philippe Flajolet ISBN: 0-201-40009-X Publisher: Addison-Wesley Pub Co Pub. Date: 30 November, 1995 Format: Hardcover Volumes: 1 List Price(USD): $57.99 |
Average Customer Rating: 4.8 (5 reviews)
Rating: 4
Summary: Not a reference guide
Comment: 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
Summary: A must have.
Comment: 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
Summary: Clear and concise
Comment: 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".
 |
Title: Concrete Mathematics: A Foundation for Computer Science (2nd Edition) by Ronald L. Graham, Donald E. Knuth, Oren Patashnik ISBN: 0201558025 Publisher: Addison-Wesley Pub Co Pub. Date: 28 February, 1994 List Price(USD): $59.99 |
 |
Title: The Design and Analysis of Computer Algorithms by Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman ISBN: 0201000296 Publisher: Addison-Wesley Pub Co Pub. Date: 01 January, 1974 List Price(USD): $54.38 |
 |
Title: Introduction to the Theory of Computation by Michael Sipser ISBN: 053494728X Publisher: Brooks Cole Pub. Date: 13 December, 1996 List Price(USD): $103.95 |
 |
Title: Introduction to Algorithms, Second Edition by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein ISBN: 0262032937 Publisher: MIT Press Pub. Date: 01 September, 2001 List Price(USD): $79.95 |
 |
Title: Computers and Intractability: A Guide to the Theory of Np-Completeness (Series of Books in the Mathematical Sciences) by Michael R. Garey, David S. Johnson ISBN: 0716710455 Publisher: W H Freeman & Co. Pub. Date: June, 1979 List Price(USD): $41.26 |
Thank you for visiting www.AnyBook4Less.com and enjoy your savings!
Copyright� 2001-2021 Send your comments
