I always wanted a book which would teach how to design algorithms, rather than just state the algorithm. CLRS while comprehensive states the algorithm first and then formally establishes correctness. While this is how most papers/books are written, I am not a big fan of such an approach. I instead prefer a tight connection between an algorithm and its proof of correctness. Udi is a master of this, and he does this very well in this book.

I must admit I have not yet read a large portion of this book. But I have read a majority of Chapter 5, which is the core chapter of this book, and I am already impressed. Thanks a lot Udi Manber for writing this jewel.

I wonder why this book is not as popular as it should be. Although the CLR is the mandatory book of most introduction to algorithm classes, it does not say much of how they came up with those algorithms which is the role of this book. The unique interesting thing is it uses induction to explain how each algorithm was developed, however I guess it's not the primary objective of the author. He wanted readers to read the description of the problems that those algorithms try to solve, and learn to apply induction to solve them on their own. If you like solving puzzle, you will love it.

Just a great book to start learning how to formulate algorithms. All CS students and those interested in algorithms should at least try to work through a chunk of this book. I wish there were more university and MOOC courses around these ideas.

As a TA I taught undergraduate algorithms courses out of this book and Cormen et. al. I found this book to provide a better intuition for how to invent algorithms using induction/recursion. To me it felt similar to the distinction between the way SICP presents how to think about programming compared to other books.

if you want to learn Algorithms, you should read CLRS introduction to Algorithms.

But if you want to learn how to design algorithms yourself then the book you need to read is this one by Udi Manber.

The approach taken by the writer is unique and to my opinion better than any other Algorithm's books I've seen.

The writer tries to teach the reader how to design algorithms through the usage of mathematical induction - hence the words "A creative approach".

I find this book to be so good, that even though I've read most of the chapters already I keep coming back to it.

This is a must read for anyone who aspires to be a computer scientist.

The condition of book is good. And the Content of book by Udi Manber is perfect ! It deserves.

I really like this book as a supplement to the algorithm bible (Introduction to Algorithms, Thomas Cormen et al). This book is tiny and portable yet every major algorithm is covered. Basics, like mathematical induction are reviewed and illustrated with relevant examples.

One of the ways that Udi Manber packs so much information into such a small package is by keeping verbosity to a minimum. In his proofs, only the most complicated steps are justified or explained. As a result the reader may find herself spending time justifying steps in the proofs that are unrelated to the problem at hand. I did not mind doing this; others may. Regardless, the persistent reader will find that within the pages of this book lies all of the information required to understand all of the algorithms covered (and of course, it never hurts to keep a notebook, pencil and several erasers handy).

I would not recommend this book as a reference; rather, it provides a refreshingly new perspective on algorithms that may seem old and dusty. I've spent more time and energy per page on this book than any other CS book I've had but the ROI has been well worth the effort.

fundamental book in theory of algorithms, focus on induction technique design, teach you how to design algorithms by induction, useful for every computer science student

perfect

Product in perfect condition