En cours de chargement...
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. The writing is clearer, more personal, and gender neutral, and color has been added to improve visual presentation. Reader feedback has informed improvements to problems. Updated notes and bibliography reflect developments in the field, and the book's web-site offers new supplementary material. New to 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.
