My notes on Skiena's book.
This commit is contained in:
parent
dbbdad3dad
commit
6c5f5bd020
13
README.md
13
README.md
|
@ -1254,6 +1254,19 @@ Supplemental:
|
|||
|
||||
**Read as a review and problem recognition**
|
||||
- [ ] [Algorithm Design Manual](http://www.amazon.com/Algorithm-Design-Manual-Steven-Skiena/dp/1849967202) (Skiena)
|
||||
- This book has 2 parts:
|
||||
- class textbook on data structures and algorithms
|
||||
- pros:
|
||||
- is a good review as any algorithms textbook would be
|
||||
- nice stories from his experiences solving problems in industry and academia
|
||||
- code examples in C
|
||||
- cons:
|
||||
- can be as dense or impenetrable as CLRS, and in some cases CLRS may be a better alternative for some subjects
|
||||
- chapters 7, 8, 9 can be painful to try to follow, as some items are not explained well or require more brain than I have
|
||||
- don't get me wrong: I like Skiena, his teaching style, and mannerisms, but I may not be Stony Brook material.
|
||||
- algorithm catalog:
|
||||
- this is the real reason you buy this book.
|
||||
- about to get to this part. Will update here once I've made my way through it.
|
||||
- To quote Yegge: "More than any other book it helped me understand just how astonishingly commonplace
|
||||
(and important) graph problems are – they should be part of every working programmer's toolkit. The book also
|
||||
covers basic data structures and sorting algorithms, which is a nice bonus. But the gold mine is the second half
|
||||
|
|
Loading…
Reference in New Issue