期中考试后内容

Divide and Conqure

• Closest pair of points in the plane
• Quick Sort
• Quick Select
• Select: Deterministic Linear Selection

Graph

Sum:

DFS, SCC algorithm, Topological Sort Algorithm, BFS, Dijkstra's shortest Path algorithm, Kruskal's algorithm, All pairs Shortest Path Algorithm, Floyd-Warshall Algorithm, Huffman Encoding, Optimal Binary Search tree, LCS, Randomized Select, Deterministic Select, Memoized-Cut-Rod, QuickSort.

Dynamic Programming

Greedy

Local optimization can lead to overall optimization. Thus, we left with one subproblem to solve. Greedy(一) Interval 专题. Classical Greedy Algorithm: Dijstra, Kruskal, Prim.

NP

P, NP, NPC, NP-Hard