Introduction to Algorithms

by Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford

• ISBN13: 9780262046305
• ISBN10: 026204630X
• eBook ISBN(s): 9780262367509
• Additional ISBN(s): 9780262033848, 9780262533058
• Edition: 4th
• Format: Hardcover
• Copyright: 2022-04-05
• Publisher: The MIT Press
• More Book Details

Summary

About This Book

Introduction to Algorithms, Fourth Edition

ISBN: 9780262046305

Introduction to Algorithms, Fourth Edition, is a comprehensive textbook designed for students and educators in the field of computer science. It's a go-to resource for those looking to delve into the world of algorithms, offering a detailed exploration of various algorithms and their design, analysis, and implementation.

Who Uses It?

Primarily, this book is used by students and instructors in introductory computer science courses at the college and university levels. It's also a valuable resource for anyone interested in understanding the basics of algorithms, including professionals looking to refresh their knowledge or expand their understanding of computational complexity and efficiency.

History and Editions

The fourth edition of Introduction to Algorithms has been updated to address user feedback, incorporating the latest research and discussions on advanced topics such as matchings in bipartite graphs, online algorithms, and machine learning. This edition includes detailed updates on solving recurrence equations, hash tables, potential functions, and suffix arrays. It also features 140 new exercises and 22 new problems, as well as reader feedback-informed improvements to old problems. The book has been a leading algorithms text in universities worldwide since its first edition and continues to be the standard reference for professionals in the field.

Author and Other Works

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein are the authors of Introduction to Algorithms. Thomas H. Cormen is known for his rigorous yet accessible writing style, which makes complex concepts in algorithms understandable to all levels of readers. The authors have collaborated on several editions of the book, ensuring that it remains current and relevant to the ever-evolving field of computer science.

Key Features

• Comprehensive Coverage: The book covers a broad range of algorithms in depth, making their design and analysis accessible to all levels of readers.
• New Chapters: Includes new chapters on matchings in bipartite graphs, online algorithms, and machine learning.
• Updated Material: Features new material on topics including solving recurrence equations, hash tables, potential functions, and suffix arrays.
• Interactive Exercises: Includes 140 new exercises and 22 new problems to help students practice and reinforce their understanding.
• Improved Writing Style: The book now features a clearer, more personal, and gender-neutral writing style.
• Visual Presentation: The addition of color improves the visual presentation of the book.
• Supplementary Material: The authors have provided a website with new supplementary material to support the learning process.

Detailed Information

ISBNs and Formats

• Hardcover: ISBN-13: 9780262046305
• eTextbook: Not available directly from the authors or primary publishers but can be rented or purchased through various online retailers.
• Renting Options: Various rental durations available from different retailers.

Publication Details

• Publisher: The MIT Press
• Publication Date: April 5, 2022
• Number of Pages: 1312
• Language: English

Other Editions and Formats

• First Edition: Available through The MIT Press and other retailers.
• Second Edition: Available through The MIT Press and other retailers.
• Third Edition: Available through The MIT Press and other retailers.

Related ISBNs:

• 9780262367509 (Paperback)
• 9780262046305 (Hardcover)
• 9780262367509 (Paperback)

This detailed information section provides a quick reference for all the available formats and sources for Introduction to Algorithms, Fourth Edition, making it easier to find and access the book in the preferred format.

Author Biography

Thomas H. Cormen is Emeritus Professor of Computer Science at Dartmouth College. Charles E. Leiserson is Edwin Sibley Webster Professor in Electrical Engineering and Computer Science at MIT. Ronald L. Rivest is Institute Professor at MIT. Clifford Stein is Wai T. Chang Professor of Industrial Engineering and Operations Research, and of Computer Science at Columbia University.
 

Table of Contents

Preface xiii
I Foundations
Introduction 3
1 The Role of Algorithms in Computing 5
2 Getting Started 17
3 Characterizing Running Times 49
4 Divide-and-Conquer 76
5 Probabilistic Analysis and Randomized Algorithms 126
II Sorting and Order Statistics 
Introduction 157
6 Heapsort 161
7 Quicksort 182
8 Sorting in Linear Time 205
9 Medians and Order Statistics 227
III Data Structures 
Introduction 249
10 Elementary Data Structures 252
11 Hash Tables 272
12 Binary Search Trees 312
12 Red-Black Trees 331
IV Advanced Design and Analysis Techniques 
Introduction 361
14 Dynamic Programming 362
15 Greedy Algorithms 417
16 Amortized Analysis 448
V Advanced Data Structures
Introduction 477
17 Augmenting Data Structures 480
18 B-Trees 497
19 Data Structures for Disjoint Sets 520
VI Graph Algorithms 
Introduction 547
20 Elementary Graph Algorithms 549
21 Minimum Spanning Trees 585
22 Single-Source Shortest Paths 604
23 All-Pairs Shortest Paths 646
24 Maximum Flow 670
25 Matchings in Bipartite Graphs 704
VII Selected Topics
Introduction 745
26 Parallel Algorithms 748
27 Online Algorithms 791
28 Matrix Operations 819
29 Linear Programming 850
30 Polynomials and the FFT 877
31 Number-Theoretic Algorithms 903
32 String Matching 957
33 Machine-Learning Algorithms 1003
34 NP-Completeness 1042
35 Approximation Algorithms 1104
VIII Appendix: Mathematical Background
Introduction 1139
A Summations 1140
B Sets, Etc. 1153
C Counting and Probability 1178
D Matrices 1214
Bibliography 1227
Index 1251