what is a complexity of linear search,binery search?
- 10 Answers
- 37393 Views
- ABB, Google, I also Faced
- E-Mail Answers
Answer Posted / pratik wavhal
For Linear Search Complexity Is :- O(n).
For Binary Search Complexity Is :- O(log(at base 2)n).
| Is This Answer Correct ? | 8 Yes | 4 No |
Post New Answer View All Answers
What are skew trees? For a tree with 4 nodes draw all possible binary? Generalize for n nodes how many binary trees can be drawn?
Explain what is the bucket size, when the overlapping and collision occur at same time?
What is bubble sort used for?
What are scalar values?
How many types of searching are there in data structure?
What are the properties of an algorithm?
Define path in a graph?
Can treemap key null?
How to create your own data structure in java?
What are the types of algorithms?
What is difference between data type and variable?
Why do we need searching algorithms?
How do you find the number of comparisons in bubble sort?
Which sorting algorithm has minimum number of swaps?
What is a treeset?
