|
|
Message from Dean - May 8th 2007
I am currently testing out a new version of the APF Bridge Component - If you notice any errors within this demo store please drop me a line.
List Price: $106.60Price: $41.99 You Save: $64.61 (61%)Prices subject to change.
Availability: Usually ships in 1-2 business days
Binding: Hardcover
Dewey Decimal Number: 005.1
EAN: 9780201743951
Edition: United States Ed
ISBN: 0201743957
Label: Addison Wesley
Manufacturer: Addison Wesley
Number Of Items: 1
Number Of Pages: 528
Publication Date: November 09, 2002
Publisher: Addison Wesley
Studio: Addison Wesley
Alternate Versions: Click to Display
Related Items:
Browse for similar items by category:
Editorial Review:
Product Description:
Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a truly innovative manner. Written in a reader-friendly style, the book encourages broad problem-solving skills while thoroughly covering the material required for introductory algorithms. The author emphasizes conceptual understanding before the introduction of the formal treatment of each technique. Popular puzzles are used to motivate readers' interest and strengthen their skills in algorithmic problem solving. Other enhancement features include chapter summaries, hints to the exercises, and a solution manual. For those interested in learning more about algorithms.
Average Rating: 
Rating: -
This was my textbook for my algorithms class at UW-Madison.
I like it better than Cormen's book, (introduction to algorithms) I think it's more readable and easy to follow.
A couple of caveats:
1.) This book is more of a survey. It does a deep-dive of some algorithms, but a lot of them only get a high-level description. If you are interested, you will have to look elsewhere for details, etc.
2.) The exercises are very well-written, and very interesting, some of them have been interview questions that I have encountered. The thing is, there is no answer key, and the hints section is not very useful at times.
Still, this book opened my eyes to the beauty of algorithms and math, and the elegance of solutions that are possible for "hard" problems.
After you read this book, you will have an idea of what is possible and it will give you enough ammunition, enthusiasm, and background for digging deeper.
A great collection to pair with ... Read More
Rating: -
Even though this book is only a few years old, it seems like a well-worn classic. That is not to say that it is outdated and irrelevant; it is exactly the opposite! While my knowledge of algorithms textbooks isn't encyclopedic, I can say that this book was way ahead of the curve in it's layout. Before it, most books presented a bunch of algorithms with some loose affiliations such as being search algorithms or dealing with graphs. This book groups algorithms into major themes and makes it much easier to learn the fundamentals of algorithm design. There have been a new set of algorithms textbooks coming out as late (Kleinberg and Tardos, Dasgupta et al, etc) that have the same approach as this book because it works so well. Don't miss out!
Rating: -
The author claims that the common used classification of algorithms have serious drawbacks and that not all important algorithms, such as Euklid algorithm, can be classified using that classification. Because of that author suggests a new classification of algorithms, containing:
* Brute force
* Divide-and-Conquer
* Decrease-and-Conquer
* Transform-and-Conquer
* Dynamic Programming
* Greedy
The proof of completeness of the classification is not given in the book, but it is obvious that more algorithms can be classified by this classification than by standard one. However, some problems built in the standard classification are not eliminated from the new one: this classification has no unique property which would be crutial property of the classification.
Book is written very good. It is interesting for reading, methodically corectly written, so it can be used as a textbook for the primary course on algorithms.
Read More
Rating: -
For those of you who've always wanted to throw the Cormen text out the window rejoice you finally can! This book is an excellent introduction to algorithms. Though not as thorough as the Cormen text it's orders of magnitude more readable!
Rating: -
I recently finished using this book for a course. I found it to be very well written and the presentation was excellent. Most books on algorithms are hard to read and overly mathematical. This book emphasizes more the textual explanation of algorithms for practical applications and not as much on theoretical proofs etc. The exercises at the end of the chapters strongly reinforce the contents and insightful hints to every exercise are given at the end of the book. I thoroughly enjoyed using this book and found it challenging. Other books I used for reference such as the MIT classic Introduction to Algorithms was also useful but much more difficult to understand initially.
Availability: Usually ships in 1-2 business days
|
Amazon Store 