Interested to Buy Any Domain ? << Click Here >> for more details...
what is a complexity of linear search,binery search?
- 10 Answers
- 40636 Views
- ABB, Google, I also Faced
- E-Mail Answers
Answer Posted / lokesh bhatt
o(n)= linear
o(log n)(base 2)= binary
bcz in linear v search one be one while in binary v divide array in two part every time
| Is This Answer Correct ? | 15 Yes | 4 No |
Post New Answer View All Answers
Which algorithm is used in arrays sort?
What is the best sorting technique?
How is the front of the queue calculated ?
Can you provide some implementation of a dictionary having large number of words?
Can binary tree have 1 child?
Write the postfix form of the expression: (a + b) * (c - d)
Define internal nodes?
Which is better arraylist or linkedlist?
Does treeset allow null?
do records fall under linear or non linear data structures?
What is a data structure? What are the types of data structures?
What are the different data structures?
What do you mean by open addressing?
What is the need for extendible hashing?
Does treemap preserve order?
