|
How to Think About Algorithms
Paperback / softback
Main Details
Title |
How to Think About Algorithms
|
Authors and Contributors |
By (author) Jeff Edmonds
|
Physical Properties |
Format:Paperback / softback | Pages:472 | Dimensions(mm): Height 233,Width 177 |
|
Category/Genre | Mathematical theory of computation |
ISBN/Barcode |
9780521614108
|
Classifications | Dewey:518.1 |
---|
Audience | Tertiary Education (US: College) | |
Illustrations |
Worked examples or Exercises; 24 Tables, unspecified; 30 Halftones, unspecified; 126 Line drawings, unspecified
|
|
Publishing Details |
Publisher |
Cambridge University Press
|
Imprint |
Cambridge University Press
|
Publication Date |
19 May 2008 |
Publication Country |
United Kingdom
|
Description
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.
Author Biography
Jeff Edmonds received his Ph.D. in 1992 at University of Toronto in theoretical computer science. His thesis proved that certain computation problems require a given amount of time and space. He did his postdoctorate work at the ICSI in Berkeley on secure multi-media data transmission and in 1995 became an Associate Professor in the Department of Computer Science at York University, Canada. He has taught their algorithms course thirteen times to date. He has worked extensively at IIT Mumbai, India, and University of California San Diego. He is well published in the top theoretical computer science journals in topics including complexity theory, scheduling, proof systems, probability theory, combinatorics, and, of course, algorithms.
Reviews'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
|