CS 312: Algorithm Analysis

1
CS 312 Algorithm Analysis

• Lecture 9 Recurrence Relations - Change of
  Variable

2
Announcements

• HW 7 Due Today
• Questions about Non-Homogeneous RR?
• Project 1
• Questions?
• Early Day is this Friday
• Due Date is the next Monday (2/5)

3
Objectives

• Lecture 8 Non-Homogeneous Recurrence Relations
• Understand how to handle non-homogeneous, linear,
  recurrence relations with constant coefficients
• These involve non-recurrence terms on the right
  hand side of the RR
• Define roots of multiplicity j
• Find the particular solution
• Find the general solution

• Lecture 9 Solving Recurrence Relations by
  Change of Variable
• Understand how to handle recurrence relations
  that are typical of divide and conquer algorithms
• Learn to use the change of variable technique

4
Divide and Conquer
5
(No Transcript)
6
(No Transcript)
7
(No Transcript)
8
(No Transcript)
9
(No Transcript)
10
(No Transcript)
11
Assignment

• Read Section 2.3
• HW 8 Part III Exercises (Section 3.2)