Recurrence Recap Dorr-351-Oct-02-2007

# Recurrence Recap Dorr-351-Oct-02-2007 - Recurrence trees...

This preview shows pages 1–4. Sign up to view the full content.

You should review material going back to the first week. For example: Rules for logs, calculus, sums, expected values, … Constructive induction, the Fibonacci examples and proofs… Algorithms that you’ve seen and now analyzed in more detail such as transitive closure, several sorts… Techniques to go from code or pseudocode to either summations or recurrences… The five asymptotic relationships, their quantified definitions, how to construct c and then n 0 for the ones that start with existential quantifiers, the limit-based definitions, how we can use these relationships to answer specific questions…

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

View Full Document

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Recurrence trees and how they can be used to get nice Big-O and Big-Omega bounds… Exam #1 is Thursday 6-7: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 • Big-Omega • Big-O 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.

### Page1 / 4

Recurrence Recap Dorr-351-Oct-02-2007 - Recurrence trees...

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

View Full Document
Ask a homework question - tutors are online