Question

QUESTION 3 To show that f(x) is O(g(x) using the definition of big o, we find Cand k such that f(x) < Cg(x) for all x > k. QU

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

to show that f(x) = O(g(x)) we have to find a +ve constant C and k such that f(x)<=Cg(x) for all x> k

to find the smallest element we have to traverse through all the elements at least once, which makes this an O(n) algorithm

Add a comment
Know the answer?
Add Answer to:
QUESTION 3 To show that f(x) is O(g(x) using the definition of big o, we find...
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