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

Progress Tracking: 每組10分鐘

• 3/9: Topic 01~04
• 3/16: Topic 05~08
• 3/23: Topic 08-1~12
• 3/30

Midterm Presentations: 每組50分鐘報告 (連四週都會點名)

4/13: Topic 01, 02

4/20: Topic 04, 05, 06

4/27: Topic 07, 08, 08-1

5/4: Topic 9, 10, 12

5/11 and 5/18: What is NP-complete?

Final Presentations: 每組50分鐘報告

5/25: Topic 01, 02, 03

6/1: Topic 04, 05, 06

6/8(16th): Topic 07, 08, 08-1

6/15: Topic 10, 11, 12

• Topic 01: Medians and Order Statistics (Chap 9) 💡
• Topic 02: Dynamic Programming: Longest common subsequence (15.4)💡
• Topic 03: Greedy Algorithms: Huffman codes (16.3)💡
• Topic 04: Elementary Graph Algorithms: Representations of graphs (22.1) and Breadth-first search (22.2) 💡
• Topic 05: Elementary Graph Algorithms: Depth-first search (22.3)
• Topic 06: Elementary Graph Algorithms: Topological sort (22.4) and Strongly connected components (22.5)
• Topic 07: Minimum Spanning Trees (23.1 💡and 23.2)
• Topic 08: String Matching: The naive string-matching algorithm (32.1) and The Rabin-Karp algorithm (32.2)💡
• Topic 08-1: String matching with finite automata (32.3)💡
• Topic 09: String Matching: The Knuth-Morris-Pratt algorithm (32.4)
• Topic 10: Computational Geometry: Line-segment properties (33.1) and Determining whether any pair of segments intersects (33.2)
• Topic 11: Computational Geometry: Finding the convex hull (33.3)
• Topic 12: Computational Geometry: Finding the closest pair of points (33.4)