Interested to Buy Any Domain ? << Click Here >> for more details...
what is a complexity of linear search,binery search?
- 10 Answers
- 40673 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 are the 3 types of measurement?
What are the advantages and disadvantages of linked list?
Define hash table?
What is difference between list set and map?
How do you separate zeros from non-zeros in an array?
What is a static structure?
How efficient is binary search?
What is ds tree?
What is the difference between null and void pointer in data structures?
What is subtree?
what is the biggest advantage of linked lists?
What is top in stack?
What is Insertion sort, selection sort, bubble sort( basic differences among the functionality of the three sorts and not the exact algorithms)?
Tell me why might quick sort might be better than merge sort?
What are the properties of binary tree?
