Algorithms, 4th Edition

This is the Safari online edition of the printed book.

Essential Information that Every Serious Programming Student Needs to Know about Algorithms and Data Structures

 

A Classic Reference

The latest version of Sedgewick’s best-selling series, reflecting an indispensable body of knowledge developed over the past several decades.

 

Broad Coverage

Full treatment of data structures and algorithms for sorting, searching, graph processing, string processing, and geometric applications, including fifty algorithms every programmer should know. See www.cs.princeton.edu/algs4/top50.

 

Completely Revised Code

New Java implementations written in an accessible, modular programming style, where all of the code is exposed to the reader and ready to use. New versions of quicksort, LZW compression, red-black tree search, RE pattern matching, and many other algorithms.

 

Engages with Applications

Algorithms are studied in the context of important scientific, engineering, and commercial applications. Clients and algorithms are expressed in real code, not the pseudo-code found in many other books.

 

Intellectually Stimulating

Engages reader interest with clear, concise text, detailed examples with visuals, carefully crafted code, historical and scientific context, and exercises at all levels.

 

A Scientific Approach

Develops precise statements about performance, supported by appropriate mathematical models and empirical studies validating those models.

 

Integrated with the Web

Visit www.cs.princeton.edu/algs4 for a freely accessible, comprehensive Web site, including text digests, program code, test data, programming projects, exercises, lecture slides, and other resources.

Preface viii

 

Chapter 1: Fundamentals 3

1.1 Basic Programming Model 8

1.2 Data Abstraction 64

1.3 Bags, Queues, and Stacks 120

1.4 Analysis of Algorithms 172

1.5 Case Study: Union-Find 216

 

Chapter 2: Sorting 243

2.1 Elementary Sorts 244

2.2 Mergesort 270

2.3 Quicksort 288

2.4 Priority Queues 308

2.5 Applications 336

 

Chapter 3: Searching 361

3.1 Symbol Tables 362

3.2 Binary Search Trees 396

3.3 Balanced Search Trees 424

3.4 Hash Tables 458

3.5 Applications 486

 

Chapter 4: Graphs 515

4.1 Undirected Graphs 518

4.2 Directed Graphs 566

4.3 Minimum Spanning Trees 604

4.4 Shortest Paths 638

 

Chapter 5: Strings 695

5.1 String Sorts 702

5.2 Tries 730

5.3 Substring Search 758

5.4 Regular Expressions 788

5.5 Data Compression 810

 

Chapter 6: Context 853

 

Index 933

List of Algorithms 954

List of Clients 955