Interested to Buy Any Domain ? << Click Here >> for more details...
what is a complexity of linear search,binery search?
- 10 Answers
- 40701 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
Please Help Members By Posting Answers For Below Questions
Can hashmap store null values?
What is arraylist load factor?
What is the difference between hashmap and linkedhashmap?
Does arraylist contain duplicates?
Name two algorithms two find minimum spanning tree?
Explain the common uses of threaded binary tree.
Can we give size to arraylist?
Can treeset contain null?
What are the goals of data structure?
Describe tree database.
How to compare Two Arrays?
What is data type and its types?
How does the bubble sort work?
Define a relation?
What is unbounded queue?
