How to Think About Algorithms

Nonfiction, Computers, General Computing, Programming
Cover of the book How to Think About Algorithms by Jeff Edmonds, Cambridge University Press
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Jeff Edmonds ISBN: 9781139637268
Publisher: Cambridge University Press Publication: May 19, 2008
Imprint: Cambridge University Press Language: English
Author: Jeff Edmonds
ISBN: 9781139637268
Publisher: Cambridge University Press
Publication: May 19, 2008
Imprint: Cambridge University Press
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Cambridge University Press

Cover of the book Forests in Revolutionary France by Jeff Edmonds
Cover of the book The Politics of National Celebrations in the Arab Middle East by Jeff Edmonds
Cover of the book The First Modern Risk by Jeff Edmonds
Cover of the book The Cambridge Companion to Chekhov by Jeff Edmonds
Cover of the book Crime and Punishment in Early Modern Russia by Jeff Edmonds
Cover of the book Learning by Expanding by Jeff Edmonds
Cover of the book Hegel, the End of History, and the Future by Jeff Edmonds
Cover of the book Aristotle: Nicomachean Ethics by Jeff Edmonds
Cover of the book The Interpersonal Dynamics of Emotion by Jeff Edmonds
Cover of the book An Introduction to English Sentence Structure by Jeff Edmonds
Cover of the book U.S.-Habsburg Relations from 1815 to the Paris Peace Conference by Jeff Edmonds
Cover of the book Bioethics, Medicine and the Criminal Law: Volume 3, Medicine and Bioethics in the Theatre of the Criminal Process by Jeff Edmonds
Cover of the book Moving Shakespeare Indoors by Jeff Edmonds
Cover of the book The Cambridge Companion to Schopenhauer by Jeff Edmonds
Cover of the book Measurement Uncertainty and Probability by Jeff Edmonds
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy