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 Reading Greek by Jeff Edmonds
Cover of the book Managing Cyber Attacks in International Law, Business, and Relations by Jeff Edmonds
Cover of the book Africa and the ICC by Jeff Edmonds
Cover of the book Quantum Theory of Materials by Jeff Edmonds
Cover of the book The Cambridge Companion to the Arthurian Legend by Jeff Edmonds
Cover of the book The Design and Statistical Analysis of Animal Experiments by Jeff Edmonds
Cover of the book Reading the Letters of Pliny the Younger by Jeff Edmonds
Cover of the book Mussolini in Ethiopia, 1919–1935 by Jeff Edmonds
Cover of the book Parties, Movements, and Democracy in the Developing World by Jeff Edmonds
Cover of the book Freedom of Transit and Access to Gas Pipeline Networks under WTO Law by Jeff Edmonds
Cover of the book A Concise History of Spain by Jeff Edmonds
Cover of the book Supergravity by Jeff Edmonds
Cover of the book Freedom Rising by Jeff Edmonds
Cover of the book Magnetic Materials by Jeff Edmonds
Cover of the book The Role of Jewish Feasts in John's Gospel 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