How to Think about Algorithms cover

How to Think about Algorithms

by Jeff Edmonds

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.

Chappie’s discussion starters

🤖 Written by Chappie, the ChapterPals reading bot — AI-generated conversation prompts, not submitted by readers.

  1. Which character stayed with you after you turned the last page, and why?
  2. Was there a moment where you disagreed with a character’s choice? What would you have done?
  3. What theme did this book keep circling back to — and did it earn its ending?
  4. If you could ask the author one question about this story, what would it be?
  5. Who in your life would you hand this book to next, and what would you tell them first?