Question

Assume it is given that T1(n) = O(g1(n)) and T2(n) = O(g2(n)). Prove or disprove each...

Assume it is given that T1(n) = O(g1(n)) and T2(n) = O(g2(n)). Prove or disprove each one of the following claims

T1(n)/T2(n) = O(g1(n)/g2(n))

0 0
Add a comment Improve this question Transcribed image text
Answer #1

f(n) = O(g(n)) if there exists a positive integer n0 and a positive constant c, such that f(n) <= c.g(n) ∀ n >= n0

Since T1(n) = O(g1(n)) and T2(n) = O(g2(n)), this means

0 <= T1(n) <= c1 * g1(n) -----------> (1)

0 <= T2(n) <= c2 * g2(n) ------------> (2)

a)

Dividing 1 by 2, we have

0 <= T1(n) / T2(n) <= (c1 / c2) * (g1(n) / g2(n))

0 <= T1(n) / T2(n) <= c3 * (g1(n) / g2(n)) where c3 = c1 / c2

Hence, T1(n) / T2(n) = O(g1(n) / g2(n))

Add a comment
Know the answer?
Add Answer to:
Assume it is given that T1(n) = O(g1(n)) and T2(n) = O(g2(n)). Prove or disprove each...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT