Textbook: https://www.cs.mcgill.ca/~akroit/math/compsci/Cormen Introduction to Algorithms.pdf

• 4 Divide-and-Conquer: The master method for solving recurrences/Proof of the master theorem
• 9 Medians and Order Statistics
• 15 Dynamic Programming: Longest common subsequence
• 16 Greedy Algorithms: Huffman codes
• 22 Elementary Graph Algorithms
  • Breadth-first search/Depth-first search
  • Topological sort/Strongly connected components
• 32 String Matching
  • The naive string-matching algorithm/The Rabin-Karp algorithm
  • String matching with finite automata
  • The Knuth-Morris-Pratt algorithm
• 33 Computational Geometry
  • Line-segment properties/Determining whether any pair of segments intersects
  • Finding the convex hull
  • Finding the closest pair of points

17 Amortized Analysis 451 17.1 Aggregate analysis 452 17.2 The accounting method 456 17.3 The potential method 459 17.4 Dynamic tables 463