Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera - scan the code below and download the Kindle app.
Introduction to Algorithms: A Creative Approach 1st Edition
This book emphasizes the creative aspects of algorithm design by examining steps used in the process of algorithms development. The heart of this creative process lies in an analogy between proving mathematical theorems by induction and designing combinatorial algorithms. The book contains hundreds of problems and examples. It is designed to enhance the reader's problem-solving abilities and understanding of the principles behind algorithm design.
From the Back Cover
This book emphasizes the creative aspects of algorithm design by examining steps used in the process of algorithm development. The heart of the creative process lies in an analogy between proving mathematical theorems by induction and designing combinatorial algorithms. The book contains hundreds of problems and examples. It is designed to enhance the reader's problem-solving abilities and understanding of the principles behind algorithm design.
0201120372B04062001
- ISBN-100201120372
- ISBN-13978-0201120370
- Edition1st
- PublisherAddison-Wesley
- Publication dateJanuary 1, 1989
- LanguageEnglish
- Dimensions9.58 x 6.6 x 0.98 inches
- Print length478 pages
Similar items that may ship from close to you
Product details
- Publisher : Addison-Wesley; 1st edition (January 1, 1989)
- Language : English
- Paperback : 478 pages
- ISBN-10 : 0201120372
- ISBN-13 : 978-0201120370
- Item Weight : 3.53 ounces
- Dimensions : 9.58 x 6.6 x 0.98 inches
- Best Sellers Rank: #792,477 in Books (See Top 100 in Books)
- #44 in Computer Algorithms
- #249 in Programming Algorithms
- #3,239 in Computer Science (Books)
- Customer Reviews:
Important information
To report an issue with this product or seller, click here.
About the author

Discover more of the author’s books, see similar authors, read author blogs and more
Customer reviews
Customer Reviews, including Product Star Ratings help customers to learn more about the product and decide whether it is the right product for them.
To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on Amazon. It also analyzed reviews to verify trustworthiness.
Learn more how customers reviews work on Amazon-
Top reviews
Top reviews from the United States
There was a problem filtering reviews right now. Please try again later.
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.
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.
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.






