CECS 528 Lectures

  1. Review of Big-O Notation
  2. Review of Big-O Notation (Annotated)
  3. Recurrence Relations
  4. Recurrence Relations (Annotated)
  5. Divide and Conquer Algorithms
  6. Divide and Conquer Algorithms (Annotated)
  7. Fast Fourier Transform
  8. Fast Fourier Transform (Annotated)
  9. Introduction to Greedy Algorithms
  10. Introduction to Greedy Algorithms (Annotated)
  11. Greedy Graph Algorithms
  12. Greedy Graph Algorithms (Annotated)
  13. Dynamic Programming Algorithms
  14. Dynamic Programming Algorithms (Annotated)
  15. Turing Reducibility
  16. Turing Reducibility (Annotated)
  17. Mapping Reducibility
  18. Mapping Reducibility (Annotated)
  19. Introduction to Complexity Theory
  20. Introduction to Complexity Theory (Annotated)
  21. Approximation Algorithms
  22. Approximation Algorithms (Annotated)
  23. Randomized Algorithms
  24. Randomized Algorithms (Annotated)
  25. Randomized Algorithms (Annotated for K-SAT Approximation Algorithm)
  26. Randomized Algorithms (Annotated for Goemans-Williamson Algorithm)