Interested to Buy Any Domain ? << Click Here >> for more details...
what is a complexity of linear search,binery search?
- 10 Answers
- 40691 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
Can you override methods of arraylist?
Write the postfix form of the expression: (a + b) * (c - d)
Why do we use dynamic arrays?
What is data and data structure?
What is a map in programming?
What does list clear do?
Which is better hashmap or arraylist?
What is raid (redundant array of inexpensive disks)?
Why do we need arrays if all the operations that are performed on arrays can be performed on arraylist?
Is array size dynamic or fixed?
What is advantage and disadvantage of linked list?
What is nsmutablearray?
Explain about map and their types?
What is 1d array?
List out the basic operations that can be performed on a stack?
