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 The Cambridge Companion to Modern Russian Culture by Jeff Edmonds
Cover of the book Parkinson's Disease by Jeff Edmonds
Cover of the book Climate Change, Public Health, and the Law by Jeff Edmonds
Cover of the book The Bible on the Shakespearean Stage by Jeff Edmonds
Cover of the book Synchrotron Radiation and Free-Electron Lasers by Jeff Edmonds
Cover of the book US International Lawyers in the Interwar Years by Jeff Edmonds
Cover of the book A History of 1930s British Literature by Jeff Edmonds
Cover of the book Encyclopaedism from Antiquity to the Renaissance by Jeff Edmonds
Cover of the book Romanticism and the Emotions by Jeff Edmonds
Cover of the book Probability and Random Processes for Electrical and Computer Engineers by Jeff Edmonds
Cover of the book Principles and Practice of Fertility Preservation by Jeff Edmonds
Cover of the book Probability and Computing by Jeff Edmonds
Cover of the book The Language of Business Meetings by Jeff Edmonds
Cover of the book Mastering Single Best Answer Questions for the Part 2 MRCOG Examination by Jeff Edmonds
Cover of the book Development after Statism 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