1. Sorting and Divide-and-Conquer
Hint for Homework 1
Sorting and
Divide-and-Conquer

2. Hint for Problem 1
not work !!!

4. Hint for Problem 4

5. Why?

6. Hint for Problem 6

7. Hint for Problem 7

8. Hint for Problem 8
(2)
(3)

11. Longest increasing subsequence

16. Planar Graph Separator
Tarjan-Lipton Theorem (1979)

17. Application

18. Example Dijkstra’s algorithm can find the shortest path from
s to t in time O((n+m) log n) where n is # of nodes
and m is # of edges.

19. Planar Graph
induction
Exercise

20. Running Time

22. A Search Problem