Introduction to Algorithms, fourth edition
Click to look inside
Introduction to Algorithms, fourth edition
Regular price
Checking stock...
Regular price
Checking stock...
Proud to be B-Corp
Our business meets the highest standards of verified social and environmental performance, public transparency and legal accountability to balance profit and purpose. In short, we care about people and the planet.
The feel-good place to buy books
- Free delivery in Ireland
- Supporting authors with AuthorSHARE
- 100% recyclable packaging
- Proud to be a B Corp – A Business for good
- Buy-back with Ziffit
Introduction to Algorithms, fourth edition by Thomas H Cormen
A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout. New for the fourth edition- New chapters on matchings in bipartite graphs, online algorithms, and machine learning
- New material on topics including solving recurrence equations, hash tables, potential functions, and suffix arrays
- 140 new exercises and 22 new problems
- Reader feedback-informed improvements to old problems
- Clearer, more personal, and gender-neutral writing style
- Color added to improve visual presentation
- Notes, bibliography, and index updated to reflect developments in the field
- Website with new supplementary material
Warning: Avoid counterfeit copies of Introduction to Algorithms by buying only from reputable retailers. Counterfeit and pirated copies are incomplete and contain errors.
Thomas H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College. He is the coauthor (with Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein) of the leading textbook on computer algorithms, Introduction to Algorithms (third edition, MIT Press, 2009). Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology. Ronald L. Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology. Clifford Stein is Professor of Industrial Engineering and Operations Research at Columbia University.
| SKU | Unavailable |
| ISBN 13 | 9780262046305 |
| ISBN 10 | 026204630X |
| Title | Introduction to Algorithms, fourth edition |
| Author | Thomas H Cormen |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | MIT Press Ltd |
| Year published | 2022-04-05 |
| Number of pages | 1332 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |