which book to follow to improve skills on algorithm analysis?

Question

which book to follow to improve skills on algorithm analysis?

Answer 1

Introduction to Algorithms is the standard college text on the subject. I've used it and can recommend it highly.

For a more pragmatic introduction (more application, less theory), I recommend Algorithms in a Nutshell.

Answer 2

Introduction to Algorithms

Answer 3

The book uses java for it's examples but is excellent in general: Data Structures & Algorithms in Java

Answer 4

TOACP, by Knuth. Altough is very dense, if you dedicate yourself, your math skills in algorithms will be increaed.

If you want a more nice lecture, look at this one:

Algorithms, 2008. by Vazirani et all (highly recommended!, besides, full text is available online)

Answer 5

Introduction to the Theory of Computation (by M Sipser) is also an excellent book for understanding, in more abstract terms, the theoretical limits and possibilities of different programming languages or architectures. If you like theory, I would even start with Sipser's book and consider CLRS as one step closer to just learning the most common problem/solution patterns in specific cases.

Answer 6

Robert Sedgewick's "Algorithms in XXXX" is good (insert language of choice for XXXX - the book is available in multiple editions). It concentrates on the implementation of the algorithms rather than deep theory.

Answer 7

Since no one has mentioned it, I'll go ahead and add Programming Pearls to the list. It's not really a textbook approach to algorithms. It's actually a collection of articles the author wrote that each take small problems and show you ways to optimize their solution. It's an interesting read and teaches you to attack problems on different levels and look for optimization in often non-obvious places.

Answer 8

Knuth: The Art of Computer Programming. Volume 1 covers fundamental analysis techniques. The algorithms are coded in assembler for hypothetical CPU and complexity is analyzed by counting instructions. His work is rather encyclopedic and requires a strong math background. You might also look at Concrete Mathematics by Knuth, Patashnik and (forgot the name) - it's not about algorithms, but it's a bit softer intro to the math used in TAOCP.

A book that is also often mentioned is M. A. Weiss: Algorithm Analysis. I have only browsed through table of contents and few pages, and it seemed decent and less mathematically heavy than Knuth.

Answer 9

In addition to the other Knuth works mentioned here (TAOCP, Concrete Mathematics), don't forget his "Selected Papers on the Analysis of Algorithms".

Answer 10

Steve Skiena's the Algorithm Design Handbook provides a great overview general techniques along with a large selection of standard building blocks. It's much lighter on theory abut but very strong on insight and practical considerations. Highly recommended.