Some books on algorithms address their subject with rigor but lack completeness. Others cover a large amount of material but in a less rigorous way. The book Introduction to Algorithms uniquely combines rigor with completeness. It covers a wide range of algorithms in depth, while keeping their design and analysis accessible to readers of all levels, with self-contained chapters and algorithms presented in pseudocode. Since its first edition, Introduction to Algorithms has become the main university textbook on algorithms in universities worldwide, as well as the primary reference book for professionals.

This edition has been updated throughout. The writing is clearer and more personal, while the addition of color has enhanced the visual presentation of the material. Feedback provided by readers has led to improvements in the problems in the book, while the notes and bibliography reflect the latest developments in the field, and the book’s website offers new supporting material.

New material in the fourth edition

• New chapters on matchings in bipartite graphs, online algorithms, and machine learning
• New material on topics such as solving recurrence equations, hash tables, potential functions, and suffix arrays
• 140 new exercises and 22 new problems