what is a complexity of linear search,binery search?
- 10 Answers
- 37347 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
What are the applications of linked list?
What is a pass in bubble sort?
What are the Differences between map and hashmap?
What are trees in data structures?
What are the complexity of binary search?
What is array define its types?
Define the queue data structure.
How do you find the complexity of a selection sort?
Does hashset maintain order?
What are the disadvantages of linear list?
What is circular linked list?
What is bubble sort with example?
Is pointer a variable?
What is the use of threaded binary tree?
Tell me what is quick sort?
