3 ms·
Yes, it's usually abbreviated as CLRS.
by abvr 8y ago
Yes, it's usually abbreviated as CLRS.
- dekhn 8y agoApparently they added an author since I last studied. Damn, that was over 10 years ago.
- abvr 8y agoYeah, quite a bit must have changed or more likely evolved through the years, so a lot of the pseudocode and algorithms have been modified or added for instance, topics on dynamic programming, memoization and the like have had more emphasis. Several revisions to examples in basic tree algorithms and additions of some too have arisen. You could consider brushing up on a few things as a casual read perhaps, especially on the new topics. Also, another book I found great was Skiena's Algorithm Design manual. [1] https://www.quora.com/What-is-the-difference-between-CLRS-second-edition-and-third-edition https://www.quora.com/What-is-the-difference-between-CLRS-se...
- dekhn 8y agoThat's OK, I don't plan to read any CS books in the future, with the exception of The Art of Computer Programming, which I feel, after many years of training (including a decade as a SWE at Google), I'm finally ready to enjoy.
- abvr 8y agoOh yes, one of my bucket list kinda goals in life is to be able to get to a level where I can grok TAoCP at a visceral level and understand the underlying mathematics used to derive the algorithmic complexities and how they all function. I think any computer science person who is passionate about the topics should give it a try at some point in their lives.