T c1 gn fn c2 gn for n n we also write fn gn

Info iconThis preview shows page 1. Sign up to view the full content.

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

Unformatted text preview: n) ≤ f(n) ≤ c2• g(n) for n ≥ N }. We also write f(n)= θ (g(n)) when f(n) is a member of θ (g(n)). f(n)= θ (g(n)) iff f(n)=O(g(n)) and g(n)=O(f(n)). f(n)= θ (g(n)) iff f(n)= Ω (g(n)) and g(n)= Ω (f(n)). Proofs and examples. 8 [email protected] Properties and Useful Functions Properties on pp. 51-52. Exercises on pp. 52-53. The ceiling and floor functions. Other functions on pp. 54—59. 9 [email protected] Summary The Random Access Machine. Big-Oh, Big-Omega, Theta notations. Properties and Commonly Used Funct...
View Full Document

This note was uploaded on 12/27/2013 for the course CSE 310 taught by Professor Davulcu,h during the Fall '08 term at ASU.

Ask a homework question - tutors are online