what is a complexity of linear search,binery search?
- 10 Answers
- 37377 Views
- ABB, Google, I also Faced
- E-Mail Answers
Answer Posted / geetika sharma
No, Above answer is wrong. The complexity of Linear search
is O(n) and
Binary search is O(log n) at the base 2
| Is This Answer Correct ? | 212 Yes | 9 No |
Post New Answer View All Answers
How to find the missing element in integer array of 1 to 7?
What is mean by abstract data type?
Define distributed query and linked server?
What is binary search in programming?
Why do we use sorting?
How does a selection sort work?
Which interfaces are implemented by concurrentskiplistset?
Why are b trees used?
What are hash tables good for?
Which is the simplest file structure? (a) Sequential (b) Indexed (c) Random (a) Sequential
Can we apply binary search algorithm to a sorted linked list, why?
Can I provide array size dynamically?
Is binary tree balanced?
How many types of priority queue are there?
Can nsarray contain nil?
