Question

Please help me to solve this Algorithm question

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

Ans.1. The dominating term is n^3. So the entire expression is always greater than n^3. Hence it is theta(n^3).

Ans.2. The dominating term is n^3. So it is always greater than the cube. Therefore, it is not O(n^2).

Add a comment
Know the answer?
Add Answer to:
Please help me to solve this Algorithm question Show that 3n^3 +/2 - 17 = theta(n^3)...
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