Introduction To Algorithms is one of the most commonly referred texts when it comes to algorithms, and is used as a textbook in several colleges.
Summary Of The Book
The contemporary study of all computer algorithms can be understood clearly by perusing the contents of Introduction To Algorithms. Although this covers most of the important aspects of algorithms, the concepts have been detailed in a lucid manner, so as to be palatable to readers at all levels of skill.
Introduction To Algorithms has a number of chapters, each of which is self-contained, as it contains an algorithm, followed by a design technique. There is also an area of application or a related topic, so that students can find out the practical implications of the algorithm in question.
There is an introduction unit, where the foundations of algorithms are covered. At all points in the book, the jargon and technical information are presented so as to be readable by anyone who has dabbled to some extent in programming. The foundation unit seeks to enlighten the reader regarding the role algorithms play in modern computer programming and the growth of functions, among other things.
Introduction To Algorithms then moves on to Sorting and Order Statistics, introducing the concepts of Heapsort and Quicksort, and also explaining how to sort in real time. A number of other topics such as Design and Analysis and Graph Algorithms are covered in the book. One feature to note in this book is that two new chapters have been added in this third edition, one on multithreaded algorithms and another on Van Emde Boas trees.
Introduction To Algorithms is a popular book that has sold more than twenty million copies in total. In fact, it is so famous that it is commonly referred to as ‘CLRS’, after the initials of the authors. The book includes new problems and exercises in this edition.
About The Authors
Charles E. Leiserson is a professor at Massachusetts Institute of Technology, in the Electrical Engineering and Computer Science department.
Leiserson is also a Margaret MacVicar Faculty Fellow. He is part of the Computer Science and Artificial Intelligence Laboratory (CSAIL) at MIT and conducts extensive research in the field of computer science.
Thomas H. Cormen is the Professor and Chair in the department of Computer Science at Dartmouth.
He completed his Ph.D from Massachusetts Institute of Technology in 1992, and has been teaching ever since. His research interests include parallel computing and algorithm engineering.
Ronald L. Rivest is a popular cryptographer and he is the Erna Viterbi Professor of Computer Science at Massachusetts Institute of Technology.
Rivest is also a member of the CSAIL, along with Professor Leiserson, and helps draft the guidelines for the Voluntary Voting System for the Election Assistance Commission.
Clifford Stein is the Professor of Computer Science as well as IEOR at Columbia University.
Stein was also chair of the IEOR department for five years from 2008 to 2013, before which he was an Assistant and Associate Professor at Dartmouth College.
|Table of Contents|
Good Math is required - Should be patient - Very detail description
excellent book but not recommended for self learners.
Certified Buyer, Hissar
Cannot be better
Step well taken in right direction
Certified Buyer, Varanasi
Amazing if you have the interest and will
Certified Buyer, Gurgaon
Best book for deep dive in Algorithms
Certified Buyer, Jaipur