Question

Provide an example of Big-O notation for a linear searching algorithm

Provide an example of Big-O notation for a linear searching algorithm

0 0
Add a comment Improve this question Transcribed image text
Answer #1
Linear searching algorithm goes through all the elements of list in worst case for finding an item.
so, in worst case it performs n operations.
so, time complexity of it is O(n)

Answer: O(n)
Add a comment
Know the answer?
Add Answer to:
Provide an example of Big-O notation for a linear searching algorithm
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