• Algorithms, 4th edition
  • 1.  Fundamentals
    • 1.1  Programming Model
    • 1.2  Data Abstraction
    • 1.3  Stacks and Queues
    • 1.4  Analysis of Algorithms
    • 1.5  Case Study: Union-Find
  • 2.  Sorting
    • 2.1  Elementary Sorts
    • 2.2  Mergesort
    • 2.3  Quicksort
    • 2.4  Priority Queues
    • 2.5  Sorting Applications
  • 3.  Searching
    • 3.1  Symbol Tables
    • 3.2  Binary Search Trees
    • 3.3  Balanced Search Trees
    • 3.4  Hash Tables
    • 3.5  Searching Applications
  • 4.  Graphs
    • 4.1  Undirected Graphs
    • 4.2  Directed Graphs
    • 4.3  Minimum Spanning Trees
    • 4.4  Shortest Paths
  • 5.  Strings
    • 5.1  String Sorts
    • 5.2  Tries
    • 5.3  Substring Search
    • 5.4  Regular Expressions
    • 5.5  Data Compression
  • 6.  Context
    • 6.1  Event-Driven Simulation
    • 6.2  B-trees
    • 6.3  Suffix Arrays
    • 6.4  Maxflow
    • 6.5  Reductions
    • 6.6  Intractability
• Related Booksites
• Web Resources
  • FAQ
  • Data
  • Code
  • Errata
  • Lectures
  • Cheatsheet
  • References
  • Coursera MOOCs
    • Algorithms, Part I
    • Algorithms, Part II
  • Certificate Courses
    • Algorithms, Part I
    • Algorithms, Part II
  • Online Course
  • Programming Assignments

Errata

Errata.

Here are the known errors. For brevity, we have suppressed the spelling and grammatical errors.

• Lecture videos/slides.

• Eleventh printing (October 2017).

• Ninth printing (December 2016), tenth printing.

• Eighth printing (August 2016).

• Fifth printing (June 2014), sixth printing, and seventh printing.

• Fourth printing (September 2013).

• Third printing (October 2012).

• Second printing (January 2012).

• First printing (March 2011).

Kindle updates.

Amazon.com does not automatically update Kindle books. In order to download the latest printing, go to Manage My Kindle -> Book Update.

Last modified on January 06, 2025.

Copyright © 2000–2025 Robert Sedgewick and Kevin Wayne. All rights reserved.