Topics for the Week of March 10, 2008
CS343: Analysis of Algorithms

• Reading: Finish Chapter 5 (skim fast fourier series), begin reading Chapter 6.

• Tues:

  • Analysis of complexity of recursive algorithms.
  • Example: closest pair of points.
  • Analysis and use of the Master Theorem

• Thurs: Prof Orr is out of town. In class, in small groups work on

  • Work on recurrence problems.
  • Work on problem 5, page 248. Hint: Sort by slope - use divide and conquer
  • Work on problem 6, page 248. Assume no ordering on value of nodes.