Lecture09-chgofvar

Lecture09-chgofvar - CS 312 Algorithm Analysis Lecture#9...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS 312: Algorithm Analysis Lecture #9: Recurrence Relations - Change of Variable Slides by: Eric Ringger, with contributions from Mike Jones, Eric Mercer, Sean Warnick This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License. Announcements § HW #6 Due Today § Questions about Non-homogeneous RR? § Feedback from TAs: § Be sure to justify your answers / show your work. § Project #2 § Quick questions? § Definition of pseudo-code Objectives § Understand how to analyze recurrence relations that are typical of divide and conquer algorithms § Learn to use the “change of variable” technique to solve such recurrences § Review Merge sort (quickly!) § Theoretical analysis using RRs § Prove the Master theorem Divide and Conquer Analysis Approach Divide and Conquer Recurrence Relation Non-Homogeneous Recurrence Relation with Geometric Forcing Function LTI Homogeneous Recurrence Relation Change of Variable Analysis of Binary Search Analysis of Binary Search...
View Full Document

Page1 / 31

Lecture09-chgofvar - CS 312 Algorithm Analysis Lecture#9...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online