Interested to Buy Any Domain ? << Click Here >> for more details...
what is a complexity of linear search,binery search?
- 10 Answers
- 40627 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
Why null is allowed in hashmap?
What is bitonic search?
Define dynamic data structures?
What is list and types of list?
Which is better than array and linked list?
What sorting algorithm does arrays sort use?
What is the difference between hashmap and arraylist?
Is hashset thread safe?
Does linked list allow null values?
Define in brief an array. What are the types of array operations?
What are the operations that can be performed on a stack?
Define non-terminal nodes in a tree?
Can you please explain the difference between string and an array?
List the applications of set adt?
What is stable sorting?
