Introduction to ALGORITHMS – Second Edition
Introduction to Algorithms is one of a series of texts written by faculty of the Electrical Engineering and Computer Science Department at the Massachusetts Institute of Technology. It was edited and produced by The MIT Pressundera joint production-distribution agreement with the McGraw-Hill Book Company. It is a book by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. It is used as the textbook for algorithms courses at many universities. It is also one of the most commonly cited references for algorithms in published papers.
This book provides acomprehensive introduction to the modern study of computer algorithms. It presents many algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. We have tried to keep explanations elementary without sacriﬁcing depth of coverage or mathemati-calrigor.
Each chapter presents analgorithm, a design technique, an application area, or a related topic. Algorithms are described in English and in a “pseudocode” designed to be readable by any one who has done a little programming. The book contains over 230 ﬁgures illustrating how the algorithms work. Since we emphasize efﬁciency as a design criterion, we include careful analyses of the running times of all our algorithms.
The text is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Because it discusses engineering issues in algorithm design, as well as mathematical aspects, it is equally well suited for self-study by technical professionals.
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
File type: pdf
Size: 1023 pages – 13.8 MB