Question

c. If an algorithm executes O(log n)-time computation for each entry of an array storing n elements, what is the Big O for st

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

`Hey,

Note: Brother if you have any queries related the answer please do comment. I would be very happy to resolve all your queries.

For 1 entry T=O(log(n))

So, for n entries starting when it is empty.

T=O(log(1))+O(log(2))+O(log(3))....+O(log(n))

So,

T<=n*log(n)

So,

T=O(n*log(n))

Kindly revert for any queries

Thanks.

Add a comment
Know the answer?
Add Answer to:
c. If an algorithm executes O(log n)-time computation for each entry of an array storing n...
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