Introduction to algorithms.
Cormen, Thomas H.
Introduction to algorithms. - Fourth Edition - Cambridge, Massachusetts The MIT Press 2022 - xx, 1291 pages; Figures, tables;
I Foundations
Introduction
1 The Role of Algorithms in Computing
2 Getting Started
3 Characterizing Running Times
4 Divide-and-Conquer
5 Probabilistic Analysis and Randomized Algorithms
II Sorting and Order Statistics
6 Heapsort
7 Quicksort
8 Sorting in Linear Time
9 Medians and Order Statistics
III Data Structures
10 Elementary Data Structures
11 Hash Tables
12 Binary Search Trees
13 Red-Black Trees
IV Advanced Design and Analysis Techniques
14 Dynamic Programming
15 Greedy Algorithms
16 Amortized Analysis
V Advanced Data Structures
17 Augmenting Data Structures
18 B-Trees
19 Data Structures for Disjoint Sets
VI Graph Algorithms
20 Elementary Graph Algorithms
21 Minimum Spanning Trees
22 Single-Source Shortest Paths
23 All-Pairs Shortest Paths
24 Maximum Flow
25 Matchings in Bipartite Graphs
VII Selected Topics
26 Parallel Algorithms
27 Online Algorithms
28 Matrix Operations
29 Linear Programming
30 Polynomials and the FFT
31 Number-Theoretic Algorithms
32 String Matching
33 Machine-Learning Algorithms
34 NP-Completeness
35 Approximation Algorithms
VIII Appendix: Mathematical Background
A Summations
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, with new chapters on matchings in bipartite graphs, online algorithms, and machine learning, and new material on such topics as solving recurrence equations, hash tables, potential functions, and suffix arrays.
Each chapter is relatively self-contained, presenting an algorithm, a design technique, an application area, or a related topic, 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. The fourth edition has 140 new exercises and 22 new problems, and color has been added to improve visual presentations. The writing has been revised throughout, and made clearer, more personal, and gender neutral. The book's website offers supplemental material.
9780262046305
Computing
Algorithms
Treorems
005.13 / C811
Introduction to algorithms. - Fourth Edition - Cambridge, Massachusetts The MIT Press 2022 - xx, 1291 pages; Figures, tables;
I Foundations
Introduction
1 The Role of Algorithms in Computing
2 Getting Started
3 Characterizing Running Times
4 Divide-and-Conquer
5 Probabilistic Analysis and Randomized Algorithms
II Sorting and Order Statistics
6 Heapsort
7 Quicksort
8 Sorting in Linear Time
9 Medians and Order Statistics
III Data Structures
10 Elementary Data Structures
11 Hash Tables
12 Binary Search Trees
13 Red-Black Trees
IV Advanced Design and Analysis Techniques
14 Dynamic Programming
15 Greedy Algorithms
16 Amortized Analysis
V Advanced Data Structures
17 Augmenting Data Structures
18 B-Trees
19 Data Structures for Disjoint Sets
VI Graph Algorithms
20 Elementary Graph Algorithms
21 Minimum Spanning Trees
22 Single-Source Shortest Paths
23 All-Pairs Shortest Paths
24 Maximum Flow
25 Matchings in Bipartite Graphs
VII Selected Topics
26 Parallel Algorithms
27 Online Algorithms
28 Matrix Operations
29 Linear Programming
30 Polynomials and the FFT
31 Number-Theoretic Algorithms
32 String Matching
33 Machine-Learning Algorithms
34 NP-Completeness
35 Approximation Algorithms
VIII Appendix: Mathematical Background
A Summations
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, with new chapters on matchings in bipartite graphs, online algorithms, and machine learning, and new material on such topics as solving recurrence equations, hash tables, potential functions, and suffix arrays.
Each chapter is relatively self-contained, presenting an algorithm, a design technique, an application area, or a related topic, 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. The fourth edition has 140 new exercises and 22 new problems, and color has been added to improve visual presentations. The writing has been revised throughout, and made clearer, more personal, and gender neutral. The book's website offers supplemental material.
9780262046305
Computing
Algorithms
Treorems
005.13 / C811