Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Suppose that sequential search is called 100 times.
What is the worst-case time complexity of these 100 calls?
Don't know
O(n)
O(1)
O(n2)
O(log n)
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!