<b>The latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow.</b>Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. <i>Introduction to Algorithms</i> uniquely combines rigor and comprehensiveness. 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 in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.<br /><br />The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on
0コメント