what is a complexity of linear search,binery search?
- 10 Answers
- 37396 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
Who invented quicksort?
How expression trees are gets represented in data structure?
What is default array size?
If you do not initialize an array what will happen?
What is difference between rb tree and avl tree?
what is the biggest advantage of linked lists?
Which sorting is worst?
Explain exception filter?
Explain the priority queue?
Is complete binary tree?
Can arraylist be empty?
What's the difference between a hashtable and a hashmap?
Which sort is stable?
Write the steps involved in the insertion and deletion of an element in the stack.
Can we create a null as a key for a map collection?
