A brief undergraduate text for Algorithms.

• Part A: Divide and Conquer; Sorting and Searching
  1. Convex Hulls: An Example
  2. Order Analysis
  3. Divide and Conquer
  4. More Divide and Conquer
  5. Finding the Median

• Part B: Greedy Algorithms and Dynamic Programming
  1. Greedy Algorithms and Spanning Trees
  2. Dynamic Programming
  3. Paths, Graphs, and Search

• Part C: Data Structures
  1. Data Structures
  2. Skip Lists
  3. Binary Search Trees
  4. Heaps and Binomial / Fibonacci Heaps
  5. Hash Tables
  6. Disjoint Set Data Structure

• Part D: Graph Algorithms
  1. Maximum Matchings
  2. Algorithms on Trees
  3. Planarity Testing

• Part E: More Algorithms
  1. String Matching Algorithms
  2. Randomized Algorithms
  3. Number-Theory Algorithms

• Part F: Other Models
  1. Parallel Sorting

• Part G: Lower Bounds and Complexity
  1. Lower Bounds
  2. Polynomial Time: P and NP
  3. NP-Completeness
  4. Approximation Algorithms

• References