Rightly, this has become the text for teaching algorithms. If you want to program serious algorithms, from sorting and searching to string matching, this book is your resource, with nearly 1,000 pages of code and discussion.
Third editions mean readers consider a book to be so successful that they want to keep on buying it. You won't be wrong getting a copy of Introduction to Algorithms yourself.
As an owner of the previous two editions, I jumped to the completely new chapter on van Emde Boas trees, and since I knew nothing about them, I was in the position of a student.
It's exciting to see for oneself how complex ideas can be taught so well.
Who is it for? Extremely useful reference for any programmers, with essential coverage of the key algorithms for all computer science degrees.
Presentation: Authoritative. The maths and the programming are clearly separated, although possibly some would prefer no maths at all!
Would you recommend it? My recommendation would be unqualified if the book were available to students in individually cheaper volumes: with its current 1,000-plus pages it's not so much an introduction as a commitment. Owners of earlier editions will find the third worth the investment just for its numerous improvements.
Introduction to Algorithms
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein
Edition: Third revised
Publisher: MIT Press