If you are looking for a basic textbook on algorithms, you cannot go wrong with Introduction to Algorithms. Often regarded as the bible in the field, it has become the standard reference book for the subject. Summary of Introduction to Algorithms
In a setting where books on algorithms are rigorously academic and complex in nature, Introduction to Algorithms takes a different approach. The algorithms in this book are presented in such a way that they are easy to understand, and each algorithm (in every chapter) is followed by interesting information on where it is applied. The book doesn't sacrifice depth for the sake of readability, and it scores with students and professionals mainly due to its comprehensive range.
The book covers topics ranging from Sorting and Order Statistics and Advanced Data Structures to Advanced Design and Analysis Techniques, Graph Algorithms, Computational Geometry and String Matching. The third edition of the book features chapters on multi-threaded algorithms and Van Emde Boas trees, which are additional concepts that can come of use to students. The sections on greedy algorithms and dynamic programming have been updated in the third edition too.
This edition also comes loaded with practice problems and exercises that can help students understand the concepts better.
About the Authors
Thomas H. Cormen
Thomas Cormen works at Dartmouth College as a Professor in the Computer Science Department. He has authored the first two editions of Introduction to Algorithms too. A graduate from the prestigious MIT, he was honored as a fellow of the National Science Foundation.
Clifford Stein
Clifford Stein is a professor at Columbia University, where he teaches Operations Research and Industrial Engineering. Apart from Introduction to Algorithms, he's also co-authored Discrete Math for Computer Science. He completed his PhD in 1992 from MIT, and he's also been honored with a doctorate from the University of Oslo.
Charles E. Leiserson
Charles Leiserson works at MIT, where he's a Professor in Computer Science and Engineering. A computer scientist with a PhD from Carnegie Mellon University, his key areas of interest include distributed computing and parallel computing.
Ronald L. Rivest
Ronald Rivest works at MIT, where he's the Andrew and Erna Viterbi Professor of Computer Science. He's worked on all three editions of Introduction to Algorithms, along with Thomas Cormen. Ronald holds a PhD from Stanford University.