---
title: Algorithms
authors:
- Robert Sedgewick
year: 1983
venue: Addison-Wesley
arxiv: null
doi: null
source: "https://algs4.cs.princeton.edu/"
topics:
- textbook
- algorithms
- sedgewick
seed_rank: 798
seed_batch: perfects-algorithms-2026-08-13
reviewed: 2026-08-13
pool: systems
relevance_score: 8
lineage: algorithms-and-complexity
cites:
- title: Introduction to Algorithms
  url: "https://mitpress.mit.edu/9780262046305/introduction-to-algorithms/"
  year: 1990
  arxiv: null
  doi: null
- title: A Dichromatic Framework for Balanced Trees
  url: "https://doi.org/10.1109/SFCS.1978.3"
  year: 1978
  arxiv: null
  doi: 10.1109/SFCS.1978.3
see:
- "797-introduction-to-algorithms"
- "765-a-dichromatic-framework-for-balanced-trees"
---

# Algorithms

## One-sentence takeaway

Sedgewick’s *Algorithms* (1983; later *Algorithms*, 4th ed. with Kevin Wayne) teaches sorting, searching, graphs, and strings from working code and empirical cost models rather than from theorem-first exposition.

## Why it matters here

This is the code-first complement to CLRS for Anoptic/ano implementers: red-black and union-find as programs you can time, plus the algs4 site as the living artifact.

## Key ideas

- First edition 1983 (Addison-Wesley); the current teaching site is algs4.cs.princeton.edu with Java implementations.
- Emphasis on cache behavior, input models, and doubling experiments next to big-O.
- Core path is elementary sorts → mergesort/quicksort → BSTs/red-black → hash tables → undirected/directed graphs → strings.
- One card for the book family; prefer the algs4 site over hunting a 1983 ISBN when you need the code.

## Caveats

## Links

- algs4 site: https://algs4.cs.princeton.edu/