CSSE 473: Session Notes - Day 11
Topics
- Review of big-theta
- Divide and conquer
- Closest pair:
- Brute force algorithm
- Divide and conquer algorithm
Outline
- [5 min] Review of big-theta
- [5 min] Divide and conquer approaches
- [15 min] Brute force algorithm for 2D closest pair problem
- [25 min] Divide and conquer algorithm for 2D closest pair problem
Resources
Homework
- Day 12, BC: Read section 5.5(Convex hull)