Question


what is the Big-o for this algorithm? 4n2+36n2log n + 18onts
0 0
Add a comment Improve this question Transcribed image text
Answer #1
Largest term 
= 36n2log2n

Largest term by removing constant multipliers
= n2log2n

Time complexity
= O(Largest term by removing constant multipliers)
= O(n2log2n)
Add a comment
Know the answer?
Add Answer to:
what is the Big-o for this algorithm? 4n2+36n2log n + 18onts
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