CSSE 473: Session Notes - Day 11

Topics

  1. Review of big-theta
  2. Divide and conquer
  3. Closest pair:
    1. Brute force algorithm
    2. Divide and conquer algorithm

Outline

  1. [5 min] Review of big-theta
  2. [5 min] Divide and conquer approaches
  3. [15 min] Brute force algorithm for 2D closest pair problem
  4. [25 min] Divide and conquer algorithm for 2D closest pair problem

Resources

Homework