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