what is a complexity of linear search,binery search?
- 10 Answers
- 37464 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 the structure of an array?
Why is null not allowed in concurrenthashmap?
What do you mean by data types?
Define a linear data structure.
List the abstract operations in the set?
What is the Role of push() and pop() method?
How many links are there in a binary tree of N nodes?
What is a Stack? Explain with example?
What is list and types of list?
Which is faster hashmap or hashtable?
What is difference between while and do while?
What are common data structures?
What is data structure operations?
What are trees in data structures?
Explain binary representation?
