Q1) A. Prove or disprove If f(n) is O(g(n)). Is then 2 f(n) = O(2 g(n) )?
Fantastic news! We've Found the answer you've been seeking!
Question:
Q1)
A. Prove or disprove
If f(n) is O(g(n)). Is then 2f(n) = O(2 g(n))?
f(n) = O(g(n)), then g(n) = O(f(n)).
nk = ø (2n)
log(n!) = ø (nlogn)
B) In each of the following situations, indicate whether f = O(g), or f = Ω(g),
or both f = ø(g).
f(n) = 100n + log n and g(n) = n + (log n)2.
f(n) = n1.01 and g(n) = n log n.
f(n) = n1/2 and g(n) = 4log n
f(n) = 2n and g(n) = 2n+1.
Related Book For
Financial and Managerial Accounting the basis for business decisions
ISBN: 978-0078111044
16th edition
Authors: Jan Williams, Susan Haka, Mark Bettner, Joseph Carcello
Posted Date: