what is a complexity of linear search,binery search?
- 10 Answers
- 37404 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
Can arraylist contain duplicates?
What is a map programming?
Is treeset sorted?
Define collision in hashing?
What is the difference between Array and LinkedList?
Why do we need to recycle?
How do you implement a stack?
How are elements stored in hashset?
Does linkedhashset allow duplicates?
What is harvesting in agriculture?
Which is better hashset or treeset?
What are b tree keys?
What is difference between hashmap and treemap?
Which sort algorithm is best?
What will happen if an array goes out of bounds?
