Question

You found 2 articles that describe the same algorithm. Also, one defines the run time of...

You found 2 articles that describe the same algorithm. Also, one defines the run time of the algorithm as Ω(?^?) and the other as Ω(?^?). Both are correct! Which one is more accurate? Explain.

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

Accurate will be Ω(?^?)


Explanation: Asymptotically N3 > N2 , We always take the least upper bound which is closest to our answer. Since N3 is the loose bound where as N2 is the tight bound. Hence N2 is more accurate as it defines us the tight bound.

Thanks, let me know if you need any more information.

Add a comment
Know the answer?
Add Answer to:
You found 2 articles that describe the same algorithm. Also, one defines the run time of...
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