01424nam a2200193 i 4500 250724s2008 |||adjo| |||| 001 0 eng d 978-0-521-614-10-8 GCL 518.1 EDM Edmonds, Jeff Jeff Edmonds How to Think about Algorithm / First Edition. USA : Cambridge University Press ; 2008 . 448 Pages : pbk. 24 cm. Index included. 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. Computer Science. ddc 0 0 ddc 0 518_100000000000000_EDM 0 5643 LPL LPL 2025-07-24 0 518.1 EDM 16037 2025-07-24 11:39:44 2025-07-24 BK 4730 4730