Skip to Main Content (Press Enter) Toggle side nav
Algorithmic Thinking by Daniel Zingaro

Algorithmic Thinking

Best Seller
Algorithmic Thinking by Daniel Zingaro
Paperback $49.95
Dec 15, 2020 | ISBN 9781718500808

Also available from:

See All Formats (1) +
  • Dec 15, 2020 | ISBN 9781718500808

    Also available from:

  • Dec 15, 2020 | ISBN 9781718500815

    Available from:

*This title is not eligible for purchase to earn points nor for redemption with your code in the Reader Rewards program

Product Details


“A good choice for anyone who needs to understand and implement algorithms.”

“With Zingaro as a tutor by your side, you’ll learn, through practice on challenging competition problems, a repeatable process for figuring out and deftly applying the most appropriate algorithmic tools for the job. You’ll learn it all from a book that exudes clarity, humor, and just the right dose of Canadian pride. Happy problem-solving!”
Dr. Tim Roughgarden, Professor of Computer Science at Columbia University

“A clear and engaging text . . . By presenting problems first and their algorithm/data structure solutions later, it shows us exactly why those solutions are useful and how they fit into the big picture. . . . Far too many textbooks present solutions fully-formed with no mention of the dead ends and too-complicated solutions you’d hit along the way. But Algorithmic Thinking takes you from the initial idea to the final breakthrough, setbacks and all. Problem solving is a raw, real journey, and this book captures its spirit perfectly. I highly recommend it.”
—Ava Pun, medal winner in the International Olympiad in Informatics Programming Competition

“The strength of the book is that the process of discovering and improving algorithms is described in detail and various different approaches are analyzed. Compared to traditional textbooks, there are also interesting topics that are not usually covered . . . Overall, the book is clearly written, the topics are well-chosen, and the book is a good introduction to some important competitive programming techniques.”
—Antti Laaksonen, Olympiads in Informatics

Table Of Contents

Chapter 1:
Hash Tables
Chapter 2: Trees and Recursion
Chapter 3: Memoization and Dynamic Programming
Chapter 4: Graphs and Breadth-First Search
Chapter 5: Shortest Paths in Weighted Graphs
Chapter 6: Binary Search
Chapter 7: Heaps and Segment Trees
Chapter 8: Union-Find
Chapter 9: Afterword
Appendix A: Algorithm Runtime
Appendix B: Because I Can’t Resist
Appendix C: Problem Credits

Get the latest updates from Daniel Zingaro
And go from well-read to best read with book recs, deals and more in your inbox every week.
And go from well-read to best read with book recs, deals and more in your inbox every week.
By clicking SIGN UP, I acknowledge that I have read and agree to Penguin Random House’s Privacy Policy and Terms of Use.
Something awesome is on its way.
Back to Top