相应的课件将在课程结束后发布。
Slides
- 🔗Topic_0
- 🔗Topic_1
- 🔗Topic_2
- 🔗Topic_3
- 🔗Topic_4_1
- 🔗Topic_4_2
- 🔗Topic_5_1
- 🔗Topic_5_2
- 🔗Topic_6_1
- 🔗Topic_6_2
- 🔗Topic_6_3
- 🔗Topic_6_4
- 🔗Topic_6_5
- 🔗Topic_7_Ch22
- 🔗Topic_7_Ch23
- 🔗Topic_7_Ch24
- 🔗Topic_7_Ch25
资料
Schedule
| 时间 | 主题 | 内容（对应《算法导论》教材） | |
|---|---|---|---|
| 1 | 9月3日（周二） | Topic 0: Introduction Topic 1: Algorithm Concept |
Introduction Chapter 1: The Role of Algorithms in Computing Chapter 2: Getting Started |
| 2 | 9月5日（周四） | Topic 1: Algorithm Concept | Chapter 2: Getting Started |
| 3 | 9月10日（周二） | Topic 2: Aysmptotic Mark and Recursive Equation | Chapter 3: Growth of Functions |
| 4 | 9月12日（周四） | Topic 2: Aysmptotic Mark and Recursive Equation Topic 3: Comparision Based Sorting Algorithm |
Chapter 3: Growth of Functions Simple Sorting Algorithms Shellsort |
| 5 | 9月19日（周四） | Topic 3: Comparision Based Sorting Algorithm Topic 4-1: Sorting in Linear Time |
Chapter 6: Heapsort Chapter 7: Quicksort Chapter 8: Sorting in Linear Time |
| 6 | 9月24日（周二） | Topic 4-1: Sorting in Linear Time | Chapter 8: Sorting in Linear Time |
| 7 | 9月26日（周四） | Topic 4-2: Medians and Order Statistics Topic 5-1: Advanced Data Structures I |
Chapter 9: Medians and Order Statistics Chapter 12: Binary Search Tree |
| 8 | 9月29日（周日） | Topic 5-1: Advanced Data Structures I | Chapter 12: Binary Search Tree |
| 9 | 10月8日（周二） | Topic 5-2: Advanced Data Structures II | Binomial Heap Chapter 19: Fibonacci Heap |
| 10 | 10月10日（周四） | Topic 5-2: Advanced Data Structures II | Chapter 19: Fibonacci Heap |
| 11 | 10月15日 （周二） | Topic 5-2: Advanced Data Structures II Topic 6-1: Dynamic Programming |
Chapter 21: Data Structure for Disjoint Sets Chapter 15: Dynamic Programming |
| 12 | 10月17日 （周四） | Topic 6-1: Dynamic Programming | Chapter 15: Dynamic Programming |
| 13 | 10月22日 （周二） | 第一次习题课 | 作业1～4，期中样卷讲解 |
| 14 | 10月24日（周四） | 期中考试 | |
| 15 | 10月29日（周二） | Topic 6-1: Dynamic Programming Topic 6-2: Greedy Algorithm |
Chapter 15: Dynamic Programming Chapter 16: Greedy Algorithm |
| 16 | 10月31日（周四） | Topic 6-2: Greedy Algorithm Topic 6-5: Knapsack Problem |
Chapter 16: Greedy Algorithm Knapsack Problem |
| 17 | 11月5日（周二） | Topic 6-3: Amortized Analysis | Chapter 17: Amortized Analysis |
| 18 | 11月7日（周四） | Topic 6-4: Divide and Conquer | Devide-and-Conquer Cases |
| 19 | 11月12日（周二） | Topic 7: Graph Algorithms | Chapter 22: Elementary Graph Algorithms |
| 20 | 11月14日（周四） | Topic 7: Graph Algorithms | Chapter 22: Elementary Graph Algorithms Chapter 23 : Minimum Spanning Trees |
| 21 | 11月19日（周二） | Topic 7: Graph Algorithms | Chapter 24 : Single-Source Shortest Paths |
| 22 | 11月21日（周四） | Topic 7: Graph Algorithms | Chapter 25 : All-Pairs Shortest Paths |