Interested to Buy Any Domain ? << Click Here >> for more details...
what is a complexity of linear search,binery search?
- 10 Answers
- 40288 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
What do you know about traversal in linked lists?
Why using cookie to store session info is a better idea than just using session info in the request?
Mention one advantage and disadvantage of using quadratic probing?
What is the best sorting technique?
What are the different binary tree traversal techniques?
Is null a binary search tree?
How to find the duplicate in an array?
Which interfaces are implemented by linkedlist?
Can arraylist have null values?
How do you represent a linked list?
What are linked list?
What is circular queue in data structure?
What is binary search tree and explain its time complexity?
Which is faster hashmap or hashset?
If we add enum constants to a sorted collection ( treemap , treeset ), what will be the order in which they will be maintained?
