what is a complexity of linear search,binery search?
- 10 Answers
- 37345 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 understand by stable sort?
How can you add an item to the beginning of the list?
What is the use of isEmpty() member methods?
Is hashmap ordered?
What is the use of data structure?
What is a threaded binary tree? Explain its operation with example?
What is the difference between Strings and Arrays?
Briefly explain recursive algorithm?
What are the main differences between the linked list and linear array?
what is the difference between Linear Array and Linked List?
How to sort 1 million floating point numbers?
Tell me is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?
How do I push an element into a stack?
Which sorting technique is best?
Explain what is the type of the algorithm used in solving the 8 queens problem?
