Algorithm Design and Analysis
算法设计与分析课程系统讲解常用算法设计方法与复杂度分析技术。核心内容包括分治法、动态规划、贪心算法、回溯法、分支限界法，以及图算法、字符串匹配、近似算法和NP完全性理论。课程注重算法正确性证明与时间空间复杂度分析，培养学生针对实际问题设计高效算法并通过实验验证其性能的能力。
This course systematically covers algorithm design techniques and complexity analysis. Topics include divide and conquer, dynamic programming, greedy algorithms, backtracking, branch and bound, graph algorithms, string matching, approximation algorithms, and NP-completeness. Emphasis is placed on correctness proof and complexity analysis, enabling students to design efficient algorithms and validate performance through experiments.
学生需完成一组算法竞赛题目，包括动态规划、贪心算法、图论等类型。要求分析时间复杂度，编写高效代码，并通过测试用例。提交源代码和解题报告。
Students solve algorithm competition problems including dynamic programming, greedy algorithms, and graph theory. Time complexity analysis and efficient code are required. Deliverables include source code and solution reports.