Introduction to the Analysis of Algorithms, An

The media could not be loaded. Llegó en tiempo y forma, agradecido estoy.

I am a first year graduate student in mathematics, so keep that in mind if you're trying to generalize my review. I use nearly all the math discussed in the text for analytic number theory (I rarely program), but this book gives an especially nice treatment of the combinatorial mathematics. I really get excited every time I have to open this book.I typically learn best from books, so I have a good sense for what a book should feature for me to learn the material as quickly and effectively as possible. It's really a drag when something as superfluous as style or a purist aesthetic makes reading sluggish or just impossible to learn from. I want a book to have many problems (ranging between medium to very hard/open problems), solutions in the back, examples to make the more difficult concepts clear, both historical and modern motivations for the material, and clean, linear descriptions. This book hits all of these except the "solutions in the back" part. Despite this one "flaw", however, this book has other great features that compensate. For example, the typesetting is fresh and makes the text more engaging. Also, there are very beautiful graphs and great reference tables. It is really a wonderful book -- the authors clearly were purposeful in the design of this text.

If you are someone who want to learn how you can analyze algorithms deeply, you should read this fascinating book.

If you would like to learn the foundation of computer science, this book is for you!

Written in the spirit of Knuth.

The Kindle edition (at least judging by the free sample) has some formatting issues that render it not so usable. Of all things, in monospaced code samples the plus sign and minus signs ("+", "++", "-", "--") are not rendered on Kindle for PC (1.10.6).Other than that, the formatting appears to be better than in many Kindle math/CS textbooks, but mis-rendered code samples make this a non-purchase for me.

Very good and complete for developers and Algorithm learners

Not at all what I was expecting. I love Math books. I also Love Math books that are related to Algorithms and so this book should have been the crown jewel. However, going into the third chapter (generating functions) I understood that I'm not going to enjoy this book. The authors, skim through the most important details leaving all the "meat" so to say, up to the reader to figure out. Generating functions are one of the most important and fundamental concepts in combinatorics and yet I left the book with a feeling that it was virtually impossible to internalize the concept.I'm really disappointed.