Sedgewick’s Algorithms Notes

This repository contains Markdown (.md) notes based on the classic book “Algorithms, 4th Edition” by Robert Sedgewick and Kevin Wayne.

The book is a great candidate for condensation, as it offers clear implementations and excellent illustrations serving as an abstract way of conveying information. With just the right amount of explanatory text added, these notes make the material more concise and accessible, ideal for refreshing key concepts and preparing for interviews.

I’ve also included personal notes where I found they help clarify certain ideas or provide additional intuition.

To maintain orthogonality and conciseness, I included content related to the Java language selectively. For the complete material, see Chapters 1.1, 1.2, and 1.3 of the book.

Table of Contents

1. Fundamentals

• 1.1 Basic Programming Model
• 1.2 Data Abstraction
• 1.3 Bags, Queues, and Stacks
• 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 Applications

3. Searching

• 3.1 Symbol Tables
• 3.2 Binary Search Trees
• 3.3 Balanced Search Trees
• 3.4 Hash Tables
• 3.5 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 Context

---

If you find any errors or inconsistencies, feel free to open an issue, and I’ll correct them promptly :)