175 books
—
246 voters
Goodreads helps you keep track of books you want to read.
Start by marking “The Algorithm Design Manual” as Want to Read:
The Algorithm Design Manual
by
This volume helps take some of the "mystery" out of identifying and dealing with key algorithms. Drawing heavily on the author's own real-world experiences, the book stresses design and analysis. Coverage is divided into two parts, the first being a general guide to techniques for the design and analysis of computer algorithms. The second is a reference section, which incl
...more
Get A Copy
Friend Reviews
To see what your friends thought of this book,
please sign up.
Reader Q&A
To ask other readers questions about
The Algorithm Design Manual,
please sign up.
Recent Questions
Community Reviews
Showing 1-30
Start your review of The Algorithm Design Manual
May 30, 2011
Ivan
rated it
it was amazing
·
review of another edition
Recommends it for:
anyone interested in algorithms and data structures
Shelves:
computer-science
When you want to read a good introductory book about algorithms and data structures the choice comes down to two books: Introduction to Algorithms, Second Edition and this one. I especially liked The Algorithm Design Manual because of the author's writing style, the "war stories" (that are some clever and practical applications of the data structures and algorithms the author tries to teach you) and the second half part of the book which is a sort of encyclopedia of problems.
I used the "introduc ...more
I used the "introduc ...more
Dec 18, 2011
Christian Brumm
rated it
it was amazing
·
review of another edition
Shelves:
cs-software
In comparison to "Introduction to Algorithms" (the other algorithm book I had significant exposure to) this one is faster to read, easier to digest and more tailored towards applications.
I found the "Hitchhiker's Guide to Algorithms" in the back to be extremely useful if you really find yourself tackling an algorithmic problem in practice.
The main part (maybe skipping/skimming down a few chapters) is a very good preparation for algorithm-heavy job interviews (e.g. Google, Facebook etc ...).
Very ...more
I found the "Hitchhiker's Guide to Algorithms" in the back to be extremely useful if you really find yourself tackling an algorithmic problem in practice.
The main part (maybe skipping/skimming down a few chapters) is a very good preparation for algorithm-heavy job interviews (e.g. Google, Facebook etc ...).
Very ...more
This book is a practical, example-driven book on computer science algorithms, which is very readable and has a wealth of ready-to-use examples. The tutorial material in the first half of the book covers the essentials: data structures such as lists, arrays, stacks, queues, binary trees, etc. The book spends a lot of time emphasizing the utility of graph algorithms and how to model various classes of problems with them, as well as lot of time on dynamic programming and backtracking/enumeration. A
...more
I can't think of an occasion when I'd recommend this over Intro to Algorithms (CLRS). It does a fraction of what CLRS does and worse in most cases. And in the rest of the cases, it does them exactly the same. There were some instances (graph algorithms) where the code in Skiena was taken straight out of CLRS. Not only did CLRS explain the algorithm better but it had the proofs to back it up.
Speaking of proofs, this is what I hated about Skiena. It has barely any proofs in comparison to CLRS. A l ...more
Speaking of proofs, this is what I hated about Skiena. It has barely any proofs in comparison to CLRS. A l ...more
This is not an introductory book. You should have some previous knowledge of algorithms to enjoy it. The book builds a way of thinking towards solving algorithms problems, instead of just stating the algorithms and data structures in a mechanical way, but in many parts it is not very clear and you have to read a passage multiple times to understand what the author meant.
The book can be used as a reference that you can use to understand a specific topic.
The book can be used as a reference that you can use to understand a specific topic.
Highly recommended for anyone interested in practical algorithm implementation.
A rare book on algorithms that is actually fun to read :)
Very good examples and explanations of algorithms that are commonly asked in interviews.
Dec 05, 2018
Joe
rated it
really liked it
·
review of another edition
Recommended to Joe by:
Fivebooks
The rare computer programming book that I finished start-to-finish.
The first half of the book tells you why some things take longer to compute than other things. This helps data scientists / statisticians / analysts who work with large amounts of data.
In the first half, the math and the computer code can get pretty heavy. But I found the text around it was written so you could skim the hard stuff, get the idea, and keep going.
The second half of the book is a reference. As Hadley Wickham said in ...more
The first half of the book tells you why some things take longer to compute than other things. This helps data scientists / statisticians / analysts who work with large amounts of data.
In the first half, the math and the computer code can get pretty heavy. But I found the text around it was written so you could skim the hard stuff, get the idea, and keep going.
The second half of the book is a reference. As Hadley Wickham said in ...more
A useful read for anyone who likes to have a deeper understanding of algorithm design. The book covers many aspects such as time/space complexity, NP-completeness, and many other concepts. The part that I personally really appreciate was the first few chapters about how to set our mindset to design an algorithm.
This book, like most academic books, is hard to read and comprehend and needs the reader to do more research about the subjects. I wish people who write these books, they come out of thei ...more
This book, like most academic books, is hard to read and comprehend and needs the reader to do more research about the subjects. I wish people who write these books, they come out of thei ...more
This book is just a bit less academic and a bit more casual than the famous "Introduction to Algorithms" however it's all about applications.
Every chapter starts off with a problem statement, then questions are asked to help identify hidden nuances of the problem, followed by a "War story" showing where exactly that particular algorithm found it's application and tricky exercises of course.
Author provides dozens of references to each topic so the reader could study the particular subject in deta ...more
Every chapter starts off with a problem statement, then questions are asked to help identify hidden nuances of the problem, followed by a "War story" showing where exactly that particular algorithm found it's application and tricky exercises of course.
Author provides dozens of references to each topic so the reader could study the particular subject in deta ...more
Of what I read and recall of this book, it was a fresh and enlightening read.
Unlike most algorithm books designed and written as textbooks, to be followed step by step from start to finish with each chapter delving into a class of algorithms in the curriculum, this seemed more a collection of interesting problems the author himself came across, that and he felt were instructive and worth sharing.
That is, it has more to do with interesting problems and the approach that goes into designing algor ...more
Unlike most algorithm books designed and written as textbooks, to be followed step by step from start to finish with each chapter delving into a class of algorithms in the curriculum, this seemed more a collection of interesting problems the author himself came across, that and he felt were instructive and worth sharing.
That is, it has more to do with interesting problems and the approach that goes into designing algor ...more
One of the best Algorithmic Design books out there: not only does it approach every problem with the consideration of heuristic and through reasoning and demonstrations, but it also helps with writing simple code.
What makes this book better than most other books about the topic is the scrupulous definition of each term, and the absurdly clear explanation of every problem and heuristic that's presented throughout the volume.
Overall, i'd definitely suggest this book to anyone interested in algorit ...more
What makes this book better than most other books about the topic is the scrupulous definition of each term, and the absurdly clear explanation of every problem and heuristic that's presented throughout the volume.
Overall, i'd definitely suggest this book to anyone interested in algorit ...more
A pretty good resource and one of the better books on the subject, in my opinion. However, many describe it as "introductory" algorithms, and I'm not sure I totally agree. Unless you already posses a solid foundation in related areas, a newbie will often find it hard to walk into this and immediately understand it. And maybe some will say that would be unrealistic, and I would be one of those. However, I actually have heard and seen others say exactly that, and again, I don't agree. Nonetheless,
...more
A work of art and mastery of many fields. Decades and decades of research in addition to the much more valuable big picture of their integration. This is *the* book to bridge the gap between theory and practice.
I don't know if this book could be read with someone with zero knowledge of the topics involved. I am a graduate student of electrical engineering who knew a reasonable lot before trying this book out and, still, couldn't read more than 40-60 pages a day (I separated 2 weeks off for this ...more
I don't know if this book could be read with someone with zero knowledge of the topics involved. I am a graduate student of electrical engineering who knew a reasonable lot before trying this book out and, still, couldn't read more than 40-60 pages a day (I separated 2 weeks off for this ...more
Holy crap, wish I'd found this book before I retired. I've been recommending Sedgwick's book for 30 years, this one is even better.
Something I really like is how he shows how useful graph theory can be. If you can turn your problem into a graph (and you'd be surprised how often you can) there are a lot of non-obvious algorithms that will beat the pants of any non-graphical algorithm. I got a B.A. in math, the most useful class I took was graph theory.
Something I really like is how he shows how useful graph theory can be. If you can turn your problem into a graph (and you'd be surprised how often you can) there are a lot of non-obvious algorithms that will beat the pants of any non-graphical algorithm. I got a B.A. in math, the most useful class I took was graph theory.
Amazing and informative book for anyone interested in knowing how algorithms shape the world we live and power almost all the electronic machines we interact with on day to day basis. Most importantly gives you a zoom out version to analyze and breakdown big problems into small informative chunks which can then be processed to get a value.
Excellent Book but obviously not for beginners. You need to do refresher course in Algorithms or take one if you are graduating. You will become good problem solver and algorithmist after completing this text. Go for it if you want to challenge your algorithmic learning.
Skiena is an extremely likeable author! I loved his stories and sense of humor. I think I'd recommend this book over CLRS, although I could imagine a past version of myself being frustrated by the practical lack of detail.
An excellent book taking a hands approach on solving algorithmic problems. A brief introduction to the algorithms followed by specific implementations of everyday problems makes it truly a ‘Hitchhiker’s Guide to Algorithms’
A very thorough book but I found that the explanations for most algorithms could have been better. I found it to be more of a reference book for looking up how to write an algorithm if you need one rather than learning well about a variety of algorithms.
The best algorithm book I read, ever.
My favorite Algorithms book. I will always read and re-read it.
Not bad, but I preferred CLRS. Okasaki is miles more enjoyable than either of them, but of course has a different scope.
Rather good as a cover to cover read and as reference as well. It might get a bit too fast paced towards the end, but still loads of good information and ideas
Explanation is an art and Skeina is a master on it.
Jun 16, 2019
Natu Lauchande
added it
Good go to book for algorithms !!!
Very conversational and witty style of writing. I finished only the first ten chapters. Plan to keep revisiting it.
explanation and examples are really good
My
There are no discussion topics on this book yet.
Be the first to start one »
Readers also enjoyed
Goodreads is hiring!
News & Interviews
Hispanic Heritage Month is the perfect time to relish the latest works from beloved Hispanic and Latinx authors like Isabel Allende, Natalia...
65 likes · 41 comments
No trivia or quizzes yet. Add some now »
“In algorithms, as in life, persistence usually pays off.”
—
10 likes
“The issue of finding the best possible answer or achieving maximum efficiency usually arises in industry only after serious performance or legal troubles.”
—
6 likes
More quotes…
