what is a complexity of linear search,binery search?
- 10 Answers
- 37376 Views
- ABB, Google, I also Faced
- E-Mail Answers
Answer Posted / saurabh teotia
the complexity of linear search is o(n) n that of binary search is o(logn)
| Is This Answer Correct ? | 66 Yes | 5 No |
Post New Answer View All Answers
What are the advantages and disadvantages of linked list?
What is bitonic search?
Why do we need a data structure?
What are the 4 types of data?
What are the advantages of linked list over array (static data structure)?
What are the Difference between tcp and udp?
How can I search for data in a linked list?
Is heap sort adaptive?
Can you have an arraylist of arrays?
Can a null element added to a treeset or hashset?
Explain the uses of binary tree.
Can arraylist be null?
what is the primary advantage of a linked list?
Can a hashmap have duplicate keys?
What does arraylist remove return?
