Session Details

Week 4, Session 13 — Mon Jun 25

Preparation

  1. Section 6.1. to presort or not to presort, that is the question.
  2. Section 6.2. You have probably seen the straightforward approach to Gaussian Elimination before; the LU decomposition approach is probebly new.

HW Due

Topics

  1. Brute Force Algorithms (continued)
  2. Divide and Conquer
  3. Closest Points
  4. QuickHull

Outline

  1. [10 min] Brute Force Algorithms
  2. [5 min] Divide and Conquer
  3. [15 min] Closest Points
  4. [20 min] QuickHull

Resources

  1. Slides

HW Assigned