User
Reputation: 1726
What is the worst case runtime for Linear search and Binary search?
I believe the worst case asymptotic complexities for Linear search and Binary Search are O(n) and O(lgn) respectively. Am I correct?
Upvotes: 0
Views: 250
Answers (1)
templatetypedef
Reputation: 372814
Yes, that's correct. Can you find examples of cases that trigger these run times?
Upvotes: 2
Related Questions
- how to calculate binary search complexity
- Binary Search: Number of comparisons in the worst case
- What would the runtime be if I used binary search and then linear search on a sorted array?
- Time Complexity of Binary Search
- Practical Efficiency of binary search
- What is the worst case for binary search
- Time complexity for modified binary search which calculates the mid as high - 2
- About worse case scenarios in binary searching
- Binary search - worst/avg case
- total time complexity of basic algorithm with binary search