CSE 530 Algorithms & Complexity (first half)

  1. Insertion sort [slides]
  2. Asymptotic notations [slides] [notes]
  3. Dynamic programming [slides][notes]
  4. Review of elementary data structures and graph algorithms [slides]
  5. Maximum Flow [slides]
  6. Introduction to linear programming [slides][notes]
  7. Standard and slack forms [slides]
  8. The simplex algorithm [slides]
  9. Interior point methods [slides]