Interested to Buy Any Domain ? << Click Here >> for more details...
what is a complexity of linear search,binery search?
- 10 Answers
- 40985 Views
- ABB, Google, I also Faced
- E-Mail Answers
Answer Posted / saurabh teotia
the complexity of linear search is o(n) n that of binary search is o(logn)
| Is This Answer Correct ? | 66 Yes | 5 No |
Post New Answer View All Answers
What is heap with example?
Why would we use dynamically allocated arrays vs vectors?
What are the difference between a stack and a queue?
What is an example of an array?
Is list a data type?
What are the types of map?
Which is faster array or linked list?
How are elements stored in hashset?
How will you represent a linked list in a graphical view?
Differentiate between set and map.
what is the difference between Linear Array and Linked List?
What is difference between data type and data structure?
What happens if we try to insert duplicate key in hashmap?
Which algorithm is used in arrays sort?
What is the impact of signed numbers on the memory?
