Introduction to the design & analysis of algorithms
by Anany Levitin · first published 2003
70% recommend30% neutral
Why HN recommends it
Organizes algorithms around problem-solving techniques like divide-and-conquer and decrease-and-conquer rather than application areas, building a reusable toolkit; suits self-learners and those wanting a refresher.
Summarised by Claude from recommending comments
my son college sybualls has to verfiy and read and write exam
Affiliate links. As an Amazon Associate I earn from qualifying purchases.
Mentions per year
What Hacker News says
Related books
2012–2025Introduction to algorithms
Udi Manber
Recommended by 14 · mentioned by 1514 recommend · 15 mention14 recommend · 1514 recommend
2007–2026Introduction to Algorithms
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
Recommended by 274 · mentioned by 712274 recommend · 712 mention274 recommend · 712274 recommend
2007–2026Concepts, techniques, and models of computer programming
Peter Van Roy, Seif Haridi
Recommended by 70 · mentioned by 9370 recommend · 93 mention70 recommend · 9370 recommend
2009–2026The art of Prolog
Leon Sterling, Ehud Yehuda Shapiro
Recommended by 36 · mentioned by 6536 recommend · 65 mention36 recommend · 6536 recommend
2007–2026How to prove it
Daniel J. Velleman
Recommended by 78 · mentioned by 10478 recommend · 104 mention78 recommend · 10478 recommend
2007–2026The algorithm design manual
Steven S. Skiena
Recommended by 195 · mentioned by 265195 recommend · 265 mention195 recommend · 265195 recommend
2008–2026The Elements of Computing Systems
Noam Nisan, Shimon Schocken
Recommended by 204 · mentioned by 268204 recommend · 268 mention204 recommend · 268204 recommend
2008–2026Working effectively with legacy code
Michael C. Feathers
Recommended by 186 · mentioned by 234186 recommend · 234 mention186 recommend · 234186 recommend
…is not the best when it comes to explaining things in an intuitive manner. It is a great reference book with lots of algorithms and proofs. In recent years I have been drawn more towards Levitin's "Introduction to the Design and Analysis of Algorithms". Anyone else have similar feelings about "Introduction to Algorithms"?
on “Top Books on Amazon Based on Links in Hacker News Comments” ↗…links below and your friendly local algorithms textbook. ■ Online Resources: Topcoder - Data Science Tutorials, The Stony Brook Algorithm Repository ■ Book Recommendations: Review of Basic Algorithms: Introduction to the Design and Analysis of Algorithms by Anany Levitin, Algorithms by S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, Algorithms For Interviews by Adnan Aziz and Amit Prakash, Algorithms Course Materials by Jeff Erickson, Introduction…
on “Ask HN: Joining Big Tech in One’s 40s” ↗Introduction to the Design and Analysis of Algorithms (http://www.amazon.com/Introduction-Design-Analysis-Algorithm...) is a good refresher.
on “Ask HN: going back to school, what books before CS?” ↗…have to agree that CLRS is probably the most thorough, but as a bare introductory book to someone learning on their own (who probably is not currently in a computer science program) I would recommend Introduction to the Design and Analysis of Algorithms by Anany Levitin. Good luck!
on “Algorithm Basics?” ↗I enjoyed reading Anany Levitin's Introduction to the Design and Analysis of Algorithms. Algorithms in this book are organized around problem-solving techniques - Decrease-and-Conquer, Divide-and-Conquer, Transform-and-Conquer etc - rather than application areas. I found this style very…
on “A Comparison of Four Algorithms Textbooks (2016)” ↗I'm biased towards more practical books but here you go - Designing Data-Intensive Applications by Kleppmann - not in your circle of interest necessarily but not in your circle of non-interest either. - Introduction to the Design & Analysis of Algorithms by Levitin - not very popular but a great book. Interestingly, it groups algorithms around design techniques e.g. decrease-and-conquer, divide-
on “Ask HN: Best value Comp. Sc. book for 100€?” ↗…Remember the quote from Invincibles: "when everyone is a superhero, nobody will be"? It applies to cramming too. Instead, use the time to study fundamentals. Pick up Kleinberg's Algorithm Design, Levitin's Introduction to the Design and Analysis of Algorithms, or Skiena's The Algorithm Design Manual. Note these books are not that academic. They all focus on the process of designing an algorithm from constraints and basic principles. - Do not worry about Leetcode…
on “Please stop the coding challenges” ↗…programming, but I'm new to writing algorithms that actually do something. I am a bit clueless at the moment, but I was wondering whether reading a textbook on the subject helps. I'm specifically considering "Introduction to the Design and Analysis of Algorithms (2nd Edition)" by Anany V. Levitin, or "Introduction to Algorithms (3d Edition)" by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Or both. Are these books any good? Are…
on “Ask HN: Do textbooks help?” ↗An illustrated cover is on Introduction to The Design and Analysis of Algorithms 2nd ed (2007) by Anany Levitin [1]. In the beginning of the Preface, we find the following: --- The most valuable acquisitions in a scientific or technical education are the general-purpose mental…
on “Wolf, Goat and Cabbage Problem” ↗I am finishing chapter 3 of SICP, doing all the exercises in the book, and I would like to keep improving my programming and CS skills, right after I am done with it -say, by 2075 plus or minus. The following is a list of titles that I consider might help me out to that end: * SICP * The Little Schemer * Essentials of Programming Languages * The Seasoned Schemer * Lisp In Small Pieces * PAIP
on “Ask HN: Study Roadmap” ↗