Introduction to Algorithms by Cormen et al. (also referred to by MIT students as "CLR"
) is the most popular and comprehensive book on Algorithms and Data structures for undergraduate students. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study.
The algorithms are described in English and detailed pseudocode
, which can then be used to implement in any programming language. This is what makes the book so great as a reference for working software engineers.
If you are using this book to prepare for a coding interview, it is best to pair it with another book that actually implements some algorithms in an actual language such as Java or Python. This is because most companies prefer candidates that can write real-world code on the white board. Check out Sedgewick's Algorithms and Gayle Laakmann's Cracking the Coding Interview
In this latest edition of the essential text and professional reference, the authors have added extensive coverage for new topics such as:
vEB trees
multithreaded algorithms
dynamic programming
edge-based flow
You can also check out Professor Cormen's Algorithm course on Khan Academy.
About the authors
Thomas H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College
.
Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology
(MIT
).
Ronald L. Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology (MIT
).
Clifford Stein is Professor of Industrial Engineering and Operations Research at Columbia University
.
Introduction to Algorithms by Cormen et al. (also referred to by MIT students as "CLR"
) is the most popular and comprehensive book on Algorithms and Data structures for undergraduate students. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study.
The algorithms are described in English and detailed pseudocode
, which can then be used to implement in any programming language. This is what makes the book so great as a reference for working software engineers.
If you are using this book to prepare for a coding interview, it is best to pair it with another book that actually implements some algorithms in an actual language such as Java or Python. This is because most companies prefer candidates that can write real-world code on the white board. Check out Sedgewick's Algorithms and Gayle Laakmann's Cracking the Coding Interview
In this latest edition of the essential text and professional reference, the authors have added extensive coverage for new topics such as:
vEB trees
multithreaded algorithms
dynamic programming
edge-based flow
You can also check out Professor Cormen's Algorithm course on Khan Academy.
About the authors
Thomas H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College
.
Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology
(MIT
).
Ronald L. Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology (MIT
).
Clifford Stein is Professor of Industrial Engineering and Operations Research at Columbia University
.