Interested to Buy Any Domain ? << Click Here >> for more details...
what is a complexity of linear search,binery search?
- 10 Answers
- 40988 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
Which file contains the definition of member functions?
What is the difference between dictionary and hashtable?
What is array indexing?
What is the use of sorting?
Explain the difference between a list and array.
What is a static structure?
Does list maintain insertion order?
What actions are performed when a function is called?
What happens if we put a key object in a hashmap which exists?
Why is arraylist faster than linkedlist?
What are the four characteristics of algorithms?
Which sorting algorithm uses minimum number of swaps?
Explain implementation of traversal of a binary tree.
What do you mean by general trees?
What is a cycle or a circuit?
