What do you think?
Rate this book
How to Think About Algorithms
There are many algorithm texts that provide lots of well-polished code and proofs of correctness. This book is not one of them. Instead, this book presents insights, notations, and analogies to help the novice describe and think about algorithms like an expert. By looking at both the big picture and easy step-by-step methods for developing algorithms, the author helps students avoid the common pitfalls. He stresses paradigms such as loop invariants and recursion to unify a huge range of algorithms into a few meta-algorithms. Part of the goal is to teach the students to think abstractly. Without getting bogged with formal proofs, the book fosters a deeper understanding of how and why each algorithm works. These insights are presented in a slow and clear manner accessible to second- or third-year students of computer science, preparing them to find their own innovative ways to solve problems.
464 pages, Paperback
First published January 1, 2008
20 people are currently reading
167 people want to read
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
Displaying 1 of 1 review
August 13, 2016
A great book, provides a very unique perspective on one of the difficult topics of computer science. Jeff puts the problems in perspective with some out of the ordinary ways to think and classify problems. He walks through some common problems with his unique processes that encourage a common approach of similar problems as opposed to memorizing solutions.
Displaying 1 of 1 review
Can't find what you're looking for?
Get help and learn more about the design.