Lecture slides

  1. Introduction (code)
  2. Data Structures I (code) 04-11-19: Removed an erroneous dot point regarding union find with random. I previously said it gets you down to inverse ackermann, turns out this is only true with a very specific method of randomization.
  3. Graph Theory I (code) 07-10-19: Changed directed to undirected on page 15
  4. Data Structures II (code) 08-10-19: Various fixes, in particular the query code for range updates range queries. 21-10-19: Fix a bug in propagate for range updates range queries
  5. Dynamic Programming (code) 16-10-19: Added one more Segment Cover example 29-10-19: Minor fixes
  6. Paradigms (code)
  7. Flow (code) 30-10-19: Add a few more slides and one more example. Fix a mistake in bipartite matching part. 04-11-19: Minor clarifications. 06-11-19: Minor fixes and finish image segmentation example.
  8. DP Optimizations (code) 06-11-19: Minor fixes. 12-11-19: Major additions to try to help clarify things.
  9. Math (code) 19-11-19: Added brief section on Inclusion/Exclusion. 20-11-19: minor fixes
  10. Last Lecture