Introduction to Algorithms

  1. Insertion sort
  2. Asymptotic notations (notes)
  3. Dynamic programming I
  4. Dynamic programming II (notes)
  5. Review of elementary data structures and graph algorithms
  6. Maximum flow I
  7. Maximum flow II
  8. Introduction to linear programming
  9. Linear programming: standard and slack forms
  10. The simplex algorithm I
  11. The simplex algorithm II
  12. Interior point methods
  13. Introduction to computational complexity I
  14. Introduction to computational complexity II
  15. Introduction to computational complexity III
  16. Algorithms for vertex cover (notes)
  17. Greedy algorithm for set cover (notes)
  18. Local search and scheduling jobs on identical parallel machines
  19. The knapsack problem
  20. The k-center problem
  21. Randomized approximation algorithm for MAX 3-SAT (notes)
  22. Randomized selection (notes)
  23. Quicksort
  24. Random binary search trees (notes)
  25. Fast Fourier transform I
  26. Fast Fourier transform II (notes)
  27. Tail inequalities (notes)
  28. Randomized distributed algorithms
  29. Set cover and deterministic rounding