This course has two main parts:
(1) Algorithm Design: In this part you will learn several classic algorithms and algorithm design ideas, including recursion, dynamic programming, linear programming and maximum flow. We will also introduce many fundemental computer science problems, and learn to design algorithms for solving these problems.
(2) Algorithm Analysis: In this part you will learn how to analyze the complexity and prove the correctness of algorithms. By learning analysis showing how classic algorithms work, you will gain basic knowledge on writing analysis/proofs.
•Complexity, Proofs
•An Introduction to Game Theory
Additionally, we will provide some interview problems that are related to algorithms, via which you can improve your interview skills.
- Teacher: XWWU, Wu Xiaowei
- Teacher: yc47469, DING YU
- Teacher: yc17434, QIU CHI
- Teacher: ylshao, Shao Yulin
- Teacher: yc37408, YANG ZIJIAN
This course has two main parts:
(1) Algorithm Design: In this part you will learn several classic algorithms and algorithm design ideas, including recursion, dynamic programming, linear programming and maximum flow. We will also introduce many fundemental computer science problems, and learn to design algorithms for solving these problems.
(2) Algorithm Analysis: In this part you will learn how to analyze the complexity and prove the correctness of algorithms. By learning analysis showing how classic algorithms work, you will gain basic knowledge on writing analysis/proofs.
•Complexity, Proofs
•An Introduction to Game Theory
Additionally, we will provide some interview problems that are related to algorithms, via which you can improve your interview skills.
- Teacher: XWWU, Wu Xiaowei