2.1 Divide-and-conquer design paradigm 2.2 Recurrence for merge sort and binary search 2.3 Powering a number 2.4 Fibonacci numbers 2.5 Recursive squaring 2.6 Matrix multiplication 2.7 Strassen's algorithm

1.1 Definition of algorithm 1.2 Insertion sort and merge sort 1.3 Running time and asymptotic analysis 1.4 Θ-notation, Ω-notation, and O-notation 1.5 Recurrences 1.6 Substitution, recursion-tree method, and master method

《算法设计与分析基础》课程教学课件（PPT讲稿）Chapter 2 Fundamentals of the Analysis of Algorithm Efficiency

网页抽取问题 SGWrap System HTML的问题 HTML约简 基本想法 问题的定义和目标 页面模型 算法设计 Future work

复旦大学：《数据结构与算法设计》综合项目_Project3. All-pairs shortest path

《计算机算法设计与分析》课程教学资源（PPT课件）第8章回溯法

复旦大学：《数据结构与算法设计》综合项目_Project1. Combining quicksort with insertion sort

北方工业大学：人工智能《算法设计与分析》课程教学大纲

一、用计算机求解问题

• Graph • Undirected graph ‣ DFS, BFS, Application • Directed graph ‣ DFS, BFS, Application