Introduction to Algorithms, fourth edition
By Charles E. Leiserson, Clifford Stein, Ronald L. Rivest, Thomas H. Cormen | Publisher: MIT Press
About the book
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.
Editions of Introduction to Algorithms, fourth edition
- Hardcover
- ISBN 9780262046305
- EBook
- ISBN 9780262367509
- EBook
- ISBN 9780262367516
Read an Excerpt
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.
Frequently Asked Questions
What is Introduction to Algorithms, fourth edition about?
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.
What core themes, tropes, or subjects are explored in Introduction to Algorithms, fourth edition?
Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures
Where can I read a sample of Introduction to Algorithms, fourth edition?
You can read an official preview of the few pages here https://www.book2look.com/book/9780262046305
Who is/are the Author/s of the book Introduction to Algorithms, fourth edition?
Charles E. Leiserson, Clifford Stein, Ronald L. Rivest, Thomas H. Cormen
Who is the Publisher of the book Introduction to Algorithms, fourth edition?
MIT Press
What are the ISBN numbers for the physical and digital editions?
Introduction to Algorithms, fourth edition is available as hardcover(ISBN 9780262046305) and ebook(ISBN 9780262367509) and ebook(ISBN 9780262367516)
Where can I buy Introduction to Algorithms, fourth edition online or support local independent bookshops?
You can buy Introduction to Algorithms, fourth edition from below
Where can I buy Introduction to Algorithms, fourth edition?