How to Think About Algorithms

Edmonds, Jeff

ISBN 10: 0521614104 / ISBN 13: 9780521614108

Editore: Cambridge University Press, 2008

Riguardo questo articolo

Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority! Codice articolo S_431398908

Dati bibliografici

Titolo: How to Think About Algorithms

Casa editrice: Cambridge University Press

Data di pubblicazione: 2008

Legatura: Paperback

Condizione: Very Good

Descrizione articolo

Riassunto:

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.

Recensione:

'Reading this is like sitting at the feet of the master: it leads an apprentice from knowing how to program to understanding deep principles of algorithms.' Harold Thimbleby, The Times Higher Education Supplement

'... a great book to learn how to design and create new algorithms ... a good book that the reader will appreciate in the first and subsequent reads, and it will make better developers and programmers.' Journal of Functional Programming