This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Recurrence trees and how they can be used to get nice BigO and BigOmega bounds… Exam #1 is Thursday 67:30pm We are given some recurrence relation that doesn’t fit into the Master Theorem well such as: T(1)=1 T(n)=T(n/4)+T(3n/4)+1 Things we want to observe. • Structure of the tree • Symmetrical? • Density? • Number of levels? • Work done • At full interior levels? • At leaves? • Asymptotic relationships • BigOmega • BigO What if we make a change to only the f(n) in the previous recurrence: T(1)=1 T(n)=T(n/4)+T(3n/4)+ n What is the impact of the f( n )?...
View
Full
Document
This note was uploaded on 01/13/2012 for the course CMSC 351 taught by Professor Staff during the Fall '11 term at University of Louisville.
 Fall '11
 Staff

Click to edit the document details