Many books on algorithms are rigorous but incomplete; others are comprehensive covering masses of topics and materials but lack rigor. **Introduction to algorithms** (pdf) – 3rd edition, thoroughly revised and updated, covers a broad range of topics in algorithms in a comprehensive manner, with design and analysis on each topic easily accessible to all levels of readers. This particular book is suitable for anyone who is new to programming or has done a very little programming.

The authors of this book are: a) **Thomas H. Cormen** (Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College), b) **Charles E. Leiserson** (Professor of Computer Science and Engineering at the MIT), c) **Ronald L. Rivest** (Professor of Electrical Engineering and Computer Science at the MIT), and d) **Clifford Stein** (Professor of Industrial Engineering and Operations Research at Columbia University).

The pdf version of Introduction to Algorithms – 3rd edition can be downloaded for free from the link below. You can also buy the book from Amazon following the referral link.

**Buy from Amazon: Introduction to Algorithms, 3rd Edition**

## Book Review:

- Title: Introduction to Algorithms
- Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein
- Edition: 3rd
- Publisher: The MIT Press
- Pages: 1313
- Format: pdf
- Size: 5.1MB

Introduction to Algorithms is considered by many to be the ‘bible’ in the field of algorithms. The first edition of the book was widely popular amongst many universities and colleges around the world as well as the standard reference book on algorithms for professionals. In the second edition, new chapters were added on the role of algorithms, linear programming, and probabilistic analysis and randomized algorithms.

The third edition of the book published by the MIT press is thoroughly revised and updated. It features two completely new chapters: a) van Emde Boas trees, one of the most useful data structures, and b) multithreaded algorithms, a topic of immense importance in the spectrum of modern algorithms.

The book is divided into a total of 8 parts and 35 chapters. The topics covered in the 8 parts are: Foundations, Sorting and Order Statistics, Data Structures, Advanced Design and Analysis Techniques, Advanced Data Structures, Graph Algorithms, Selected Topics, and Appendix. Each of these chapters is comparatively self-contained and can be viewed as a unit of study.

Many new exercises and problems have been added in the 3rd edition. Also, this version includes improvement on topics such as dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks.

The algorithms described in Introduction to Algorithms are in English and all code examples are presented in the form of pseudocode. The pseudocode can be easily understood by anyone who’s relatively new to programming. The explanation on each topic is rigorous as well as engaging; it doesn’t sacrifice the depth, importance, and coverage of the topic in consideration.

In light of the explosive growth in the amount of data and the diversity of computing applications, efficient algorithms are needed now more than ever. This beautifully written, thoughtfully organized book is the definitive introductory book on the design and analysis of algorithms. The first half offers an effective method to teach and study algorithms; the second half then engages more advanced readers and curious students with compelling material on both the possibilities and the challenges in this fascinating field.

— Shang-Hua Teng, University of Southern California

**Buy from Amazon: Introduction to Algorithms, 3rd Edition**

Introduction to Algorithms provides an encyclopedic treatment in light of modern algorithms and best practices. It is a mandatory-in-the-shelf book for any person who’s interested in the profession of software development/engineering or anyone who’s a computer science/engineering student.

You can find more Algorithms books here.

Thanks.