※※ 课 程 教 案 ※※

Lecture 01 - Introduction to algorithm analysis (slide)

Lecture 02 - Asymptotic behavior of functions (slide)

Lecture 03 - Insertion sorting and Shell sorting (slide)

Lecture 04 - Quicksort and Divide-and-conquer (slide)

Lecture 05 - Mergesort and Optimality (slide)

Lecture 06 - Heapsort and algorithm improvement (slide)

Lecture 07 - Selection and adversary arguments (slide)

Lecture 08 - Balanced binary search tree (slide)

Lecture 09 - Hashing and amortized analysis (slide)

Lecture 10 - Union-Find (slide)

Lecture 11 - Graph traversal (slide)

Lecture 12 - Directed acyclic graph and applications (slide)

Lecture 13 - Traversing undirected graphs (slide)

Lecture 14 - Minimum spanning tree and Greedy methods (slide)

Lecture 15 - Transitive closure and related problems (slide)

Lecture 16 - Multiplying bit matrices (slide)

Lecture 17 - Dynamic programming (slide)

Lecture 18 - String matching I (slide)

Lecture 19 - String matching II (slide)

Lecture 20 - NP-completeness (slide)

Lecture 21 - More about NPC problems (slide)

Lecture 22 - Probabilistic algorithm (slide)