what is a complexity of linear search,binery search?
- 10 Answers
- 38756 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 is scalar data type?
Define non linear data structure.
What are lists?
What are the advantages of binary search over linear search?
What do you mean by level of the tree?
What is the use of bubble sort?
Write a program to reverse a single linked list.
What is the best data structure and algorithm to implement cache?
What is the difference between for and foreach loop?
When would you use a tuple?
Explain about map and their types?
What is a pass in bubble sort?
What is the height of an empty tree?
Is char array null terminated?
What is a map programming?
