Introduction to Algorithms is a book by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The book has been widely used as the textbook for algorithms courses at many universities and is commonly cited as a reference for algorithms in published papers, with over 10,000 citations documented on CiteSeerX. The book sold half a million copies during its first 20 years. Its fame has led to the common use of the abbreviation “CLRS” (Cormen, Leiserson, Rivest, Stein), or, in the first edition, “CLR” (Cormen, Leiserson, Rivest).
In the preface, the authors write about how the book was written to be comprehensive and useful in both teaching and professional environments. Each chapter focuses on an algorithm, and discusses its design techniques and areas of application. Instead of using a specific programming language, the algorithms are written in Pseudocode. The descriptions focus on the aspects of the algorithm itself, its mathematical properties, and emphasize efficiency.
I Foundations Introduction 1 The Role of Algorithms in Computing 2 Getting Started 3 Growth of Functions 4 Divide-and-Conquer 5 Probabilistic Analysis and Randomized Algorithms II Sorting and Order Statistics Introduction 6 Heapsort 7 Quicksort 8 Sorting in Linear Time 9 Medians and Order Statistics III Data Structures Introduction 10 Elementary Data Structures 11 Hash Tables 12 Binary Search Trees 13 Red-Black Trees 14 Augmenting Data Structures IV Advanced Design and Analysis Techniques Introduction 15 Dynamic Programming 16 Greedy Algorithms 17 Amortized Analysis V Advanced Data Structures Introduction 18 B-Trees 19 Fibonacci Heaps 20 van Emde Boas Trees 21 Data Structures for Disjoint Sets VI Graph Algorithms Introduction 22 Elementary Graph Algorithms 23 Minimum Spanning Trees 24 Single-Source Shortest Paths 25 All-Pairs Shortest Paths 26 Maximum Flow VII Selected Topics Introduction 27 Multithreaded Algorithms 28 Matrix Operations 29 Linear Programming 30 Polynomials and the FFT 31 Number-Theoretic Algorithms 32 String Matching 33 Computational Geometry 34 NP-Completeness 35 Approximation Algorithms Contents xi VIII Appendix: Mathematical Background Introduction A Summations B Sets, Etc. C Counting and Probability D Matrices Bibliography Index
算法导论·第三版·英文版-[美]Thomas H. Cormen-[文字版].pdf: https://liangz.pipipan.com/fs/15717665-331861168
算法导论·第三版·英文版-[美]Thomas H. Cormen-[文字版].pdf: https://liangz.ctfile.com/fs/15717665-331861168
版权声明:  本站原创文章，于 2019-01-18，由 Darker 发表。
转载请注明：原文地址：《书籍分享–《Introduction to Algorithms Third Edition》 | 飘零博客》