Interested to Buy Any Domain ? << Click Here >> for more details...
what is a complexity of linear search,binery search?
- 10 Answers
- 40635 Views
- ABB, Google, I also Faced
- E-Mail Answers
Answer Posted / guest
in linear search each element in the array should be checked
until the required element got searched whereas in binary
search array is divided into two and required element is
searched
| Is This Answer Correct ? | 28 Yes | 1 No |
Post New Answer View All Answers
What is dynamic data structure?
Is arraylist better than array?
How many null values are allowed in a set?
Why using cookie to store session info is a better idea than just using session info in the request?
What is concurrentlinkeddeque?
What is the need of sorting?
Treemap orders the elements on which field?
What is the difference between hashmap and treemap?
Can we add elements to final list?
List all data structures you would use for a memory management module.
What do you mean by secondary clustering?
How to find 3rd element from end in a linked list in one pass?
Why do we need sorting?
Why is hashmap not thread safe?
State the advantages of using infix notations?
