Algorithm Design: Foundations, Analysis, and Internet Examples

Good price

It is great as a textbook to learn about algorithms.The book emphasizes on writing pseudo-code for algorithms. There is a rich number of sorting, searching algorithms, along with popular abstract data structures. The part about graph theory is especially good when accompanied by the Power point.For reference, other books may be better because this book has much introductory content.

There are many good books with this title or similar ones. This is probably one of the better ones for your bookshelf and for use in academia. The examples are written in Java (a current language) and they are easy to read. The presentation is clean and illustrative. The authors have a good track record for expertise and papers published, and you get the sense that it is more real-world than most similar books.

This a great book...for me to poop on!This is not a book - it is a dissertation. Why any instructor would choose this book when you can come to Amazon and look at the reviews for this book (and others) is beyond me. Not only does this book read like stereo instructions, the questions themselves are vague and often times have no real viable reference point in the book.The only thing I used this book for was to complete the homework assignments that (sadly) used the questions therein. All my other learning came from outside sources.If you are a student, there are loads of well written books on Amazon that can help you, in addition to mountains of algorithm videos on youtube.If you are an instructor, please employ some logic and require a book that has a sterling reputation and the reviews to match. Otherwise, you may find your own end of semester reviews mimicking those of this book.

This book will take you from "programmer" to "engineer". Recommended to me by a Google engineer. You use her work everyday.You need understanding of programming fundamentals to use this book. With that said, if you finish this book and the exercises, you'll be in the top ranks.Easy to read and not quite as dense as CLRS Introduction to Algorithms.

If you are trying to learn the concepts outlined in this book you will likely need additional material. The authors are not good at explaining the concepts in a clear and concise way. They unnecessarily use long winded and complex explanations for even basic ideas. This book is probably good for someone who's fairly familiar with the topics and has a decent discrete math background.The book feels more like a thesis or an academic paper, than something meant to educate.There were certain topics that were written so poorly that even after re-reading 3-4 times I still had no idea what it meant. And only after reading a paragraph from Wikipedia did I understand the concept. I don't understand why the authors felt the need to add so much unnecessarily jargon, as it only helps confuse the readers.The only reason I gave 2 stars is because I feel that once you learn the material elsewhere, this book may server as a good reference guide.

The book came in great condition. The content within the book is very interesting and recommended to those who are interested in comparing/analyzing different algorithms asymptotically. I bought the book for a college course, and I plan on keeping it.

The Math concepts are out of most people's league. At the beginning of the book, they attempt to do a "Math Review", but it's incomprehensible. If you're a Math Professor or have taken very high levels of Math, you'll do okay with this book. Otherwise, hope and pray you have a professor who also isn't a Math stickler.It appears the Author wants to show off with their Math skills while leaving the reader in the dust. I literally had to watch numerous YouTube videos to understand simple things like Bucket Sort, because the author made simple concepts impossible to understand. Some people are too smart to be writing books. Go be a nerd somewhere else and work on rocket ships or something where your nerdy Math skills can be worshiped by other Math nerds.