-
How to Think About Algorithms (Paperback)
$35.97 - Save $3.77 (9%) - RRP $39.74 Free delivery worldwide (to United States and
all these other countries) Usually dispatched within 48 hours | |Short Description for How to Think About AlgorithmsTextbook that teaches students how to think about algorithms like an expert, without getting bogged down in formal proof.
Full description- Publisher: CAMBRIDGE UNIVERSITY PRESS
- Published: 19 May 2008
- Format: Paperback 472 pages
- See: Full bibliographic data
- Categories: Computing: General | Algorithms & Data Structures | Mathematical Theory Of Computation
- ISBN 13: 9780521614108 ISBN 10: 0521614104
- Sales rank: 339,842
Other books
Full description for How to Think About Algorithms
This textbook, for second- or third-year students of computer science, presents insights, notations, and analogies to help them describe and think about algorithms like an expert, without grinding through lots of formal proof. Solutions to many problems are provided to let students check their progress, while class-tested PowerPoint slides are on the web for anyone running the course. By looking at both the big picture and easy step-by-step methods for developing algorithms, the author guides students around the common pitfalls. He stresses paradigms such as loop invariants and recursion to unify a huge range of algorithms into a few meta-algorithms. The book fosters a deeper understanding of how and why each algorithm works. These insights are presented in a careful and clear way, helping students to think abstractly and preparing them for creating their own innovative ways to solve problems.

