Introduction to Algorithms, 3rd Edition
Ronald Linn Rivest is an MIT Institute Professor and cryptographer. Professor of Computer Science and Engineering at the Massachusetts Institute of Technology. Charles E. Leiserson Thomas H. Cormen is an Emeritus Professor of Computer Science at Dartmouth College and the former Director of the Dartmouth College Institute for Writing and Rhetoric. Clifford Seth Stein is a professor of industrial engineering and operations research at Columbia University in New York, NY, where he also maintains a position in the Department of Computer Science. Introduction to Algorithms, co-authored by T. Cormen, C. Leiserson, and R. Rivest, is the best-selling algorithm textbook and has been translated into eight languages. This book receives about 39,500 of Stein's 46,000 citations.
Some algorithms books are thorough but incomplete, while others cover a lot of ground but lack rigor. Introduction to Algorithms is the only book that combines rigor with breadth. The book delves into a wide range of algorithms in depth while making their design and analysis accessible to readers of all skill levels. Each chapter is self-contained and can be utilized as a study unit on its own. The algorithms are given in English and pseudocode that anyone who has done some programming may understand. Without losing the depth of coverage or mathematical rigor, the explanations have been kept simple.
The first edition became a standard reference for professionals as well as a frequently utilized work in institutions around the world. New chapters on the role of algorithms, probabilistic analysis, randomized algorithms, and linear programming were included in the second edition. The third edition has been thoroughly edited and updated. It features two whole new chapters on van Emde Boas trees and multithreaded algorithms, as well as significant updates to the recurrence chapter (now dubbed "Divide-and-Conquer") and a matrices appendix. The content on flow networks includes an updated treatment of dynamic programming and greedy algorithms, as well as a new notion of edge-based flow. For this edition, many new exercises and problems have been introduced. The international paperback edition has been discontinued; however, the hardcover edition is still accessible globally.
Some reviews about this book: “This is the definitive textbook on algorithms and something no Computer Science student or researcher should ever be without. That said, the approach, whilst detailed, is at times quite dry and heavy going, and could perhaps be broken up a little more to keep the reader refreshed and focused.”
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein.
Link to buy: https://www.amazon.com/-/es/Thomas-H-Cormen/dp/0262033844/ref=sr_1_1?
