Jeff Edmonds, "How to Think About Algorithms"Cambridge University Press | ISBN-10: 0521849314 | May 19, 2008 | 472 pages | PDF | 5.5MB
Rather than provide lots of well-polished code and proofs of correctness, this book presents insights, notations, and analogies to help the novice describe and think about algorithms like an expert. It stresses paradigms such as loop invariants and recursion to unify a huge range of algorithms into a few meta-algorithms.
1 Comment(s):
Good book...thanks
Post a Comment