
Introduction to the design & analysis of algorithms
Anany Levitin · 2003
Programming and computer science › Algorithms and coding interviews
#4,101 most recommended
Hacker News
10
mentions by 10 people · top 29% of 15,732 books
Open Library
5.00★★★★★★★★★★
1 rating · 17 want to read
Wikipedia
—
No article yet
About the book
A textbook on the design and analysis of algorithms, covering how to specify algorithms, measure their time and space efficiency, and prove their correctness. It spans sorting, searching, graph problems, string matching, and the limits of efficient computation, including NP-completeness. Its central claim is that most algorithms are instances of a small number of general problem-solving strategies, including brute force, divide-and-conquer, decrease-and-conquer, transform-and-conquer, dynamic programming, the greedy technique, and iterative improvement, so the book is organized by these strategies rather than by application domain. It presents an analysis framework based on counting basic operations and classifying growth rates with asymptotic notation, and it encourages readers to learn to match a new problem to a technique rather than memorize individual solutions. Later chapters on the limitations of algorithmic power and on coping with intractable problems show where these strategies stop working.
Written by Claude from what it knows of this book.
What Hacker News says 70% recommend · 0% critical
In the commenters’ own words
Just as one data point - I went through the onsite recently and I personally found that PDF to be unhelpful. While it does list everything you need to know…
If one does want to get into FANNG-like companies or whatever those acronyms are, I'd suggest a few practical tips. - Use probability as your advantage. Or…
What Open Library readers say 5.00 from 1 rating
- 51
- 40
- 30
- 20
- 10
- 17 want to read
- 2 reading
- 3 have read
Only 1 rating: treat the average as a hint.
What critics say, via Wikipedia
No Wikipedia article about this book yet, so no critics to quote.
Reddit communities — coming later
The threads it came up in
Details
- First published
- 2003
- ISBN
- 9780321358288
- Editions known
- 6 at Open Library
- Open Library
- OL5840892W
AlgorithmsComputer algorithms
Read next: its neighbours on the mosaic
A practical guide to data structures and algorithms using javaSally A. Goldman · 2007 · recommended by 1 person · similar by subject and what people say about it
Algorithms for interviewsAdnan Aziz · 2010 · recommended by 4 people · similar by subject and what people say about it
Introduction to AlgorithmsThomas H. Cormen · 1990 · recommended by 274 people · named together in 5 comments
The way of analysisRobert S. Strichartz · 1995 · recommended by 3 people · similar by subject and what people say about it
Programming interviews exposedJohn Mongan · 2007 · recommended by 29 people · similar by subject and what people say about it
Introduction to the theory of computationMichael Sipser · 1997 · recommended by 66 people · similar by subject and what people say about it
The algorithm design manualSteven S. Skiena · 1998 · recommended by 195 people · similar by subject and what people say about it
Analysis PatternsMartin Fowler · 1996 · recommended by 6 people · similar by subject and what people say about it
Biological sequence analysisRichard M. Durbin · 1998 · recommended by 9 people · similar by subject and what people say about it
Problems in Mathematical AnalysisBoris Demidovich · 1969 · recommended by 3 people · similar by subject and what people say about it
The Elements of Statistical LearningTrevor Hastie · 2001 · recommended by 144 people · similar by subject and what people say about it
The C Programming LanguageBrian W. Kernighan · 1978 · recommended by 246 people · similar by subject and what people say about it
The art of computer programmingDonald Knuth · 1968 · recommended by 336 people · similar by subject and what people say about it
Algorithms to Live ByBrian Christian · 2016 · recommended by 69 people · similar by subject and what people say about it
Grokking AlgorithmsAditya Y. Bhargava · 2016 · recommended by 42 people · similar by subject and what people say about it
Introduction to linear algebraGilbert Strang · 1998 · recommended by 37 people · similar by subject and what people say about it
Algorithm designJon Kleinberg · 1922 · recommended by 30 people · similar by subject and what people say about it
Modern C++ DesignAndrei Alexandrescu · 2001 · recommended by 29 people · similar by subject and what people say about it
Algorithms in C++Robert Sedgewick · 1990 · recommended by 27 people · similar by subject and what people say about it
Introduction to automata theory, languages, and computationJohn E. Hopcroft · 1979 · recommended by 24 people · similar by subject and what people say about it
Pearls of functional algorithm designBird, Richard · 2010 · recommended by 17 people · similar by subject and what people say about it
How to Think About AnalysisLara Alcock · 2014 · recommended by 15 people · similar by subject and what people say about it
Algorithms in a nutshellGeorge T. Heineman · 2008 · recommended by 12 people · similar by subject and what people say about it
AlgorithmsRobert Sedgewick · 2011 · recommended by 50 people · similar by subject and what people say about it