陆昱宽

Outline:

• Single-Sources shortest paths( SSSP )

  • Dijkstra algorithm by example
  • Priority queue-based implementation
  • Proof of correctness

• All-pairs shortest paths( APSP )

  • Shortest path and transitive closure
  • Warshall algorithm for transitive closure
    • BF1, BF2, BF3 => Warshall algorithm
    • Floyd algorithm for shortest paths

Ref:

• 算法设计与分析(Algorithm design and analysis) by 黄宇

Outline:

• Optimization Problem
• Greedy Strategy

Ref:

• 算法设计与分析(Algorithm design and analysis) by 黄宇

• 数学归纳法
• QuickSort
• 堆

Ref:

• 算法设计与分析(Algorithm design and analysis) by 黄宇

DAG(Directed Acyclic Graph), DAG's topological ordering and SCC(Strongly Connected Component).

Ref: 算法设计与分析(Algorithm design and analysis) by 黄宇.

Outline：

• General DFS/BFS Skeleton
• Depth-First Search Trace

Ref: 算法设计与分析(Algorithm design and analysis) by 黄宇

Outline:

• The searching problem
  • The ambition of hashing
• Hashing
  • Brute force table: direct addressing
  • Basic idea of hashing
• Collision Handling for Hashing
  • Closed address hashing
  • Open address hashing
• Amortized Analysis
  • Array doubling

Ref:

• 算法设计与分析(Algorithm design and analysis) by 黄宇

Union Find algorithm.

Ref:

• 算法设计与分析(Algorithm design and analysis) by 黄宇
• 并查集（Union-Find）算法 by labuladong

Outline

• Lower bound and adversary argument
• Selection - select the median
  • Expected linear time
  • Worst-case linear time
• A Lower bound for Finding the Median

Ref:

• 算法设计与分析(Algorithm design and analysis) by 黄宇

Latex grammer.

Oultline

• MergeSort
  • Worst-case analysis of MergeSort
  • More than sort: the MergeSort D&C
• Lower Bounds for comparison-based sorting ( nlogn )
  • Worst-case ( Omega(nlogn) )
  • Average-case (nlogn - 1.443n )

Ref:

• 算法设计与分析(Algorithm design and analysis) by 黄宇