what is a complexity of linear search,binery search?
- 10 Answers
- 37397 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 is dequeue in data structure?
Why is hashmap faster than arraylist?
What is a treemap chart?
What do you mean by open addressing?
Why is tuple immutable?
Can binary tree have 1 child?
Which sorting algorithm is best for large data?
What is hashing technique?
Tell me the difference between structure and array?
Is int a data structure?
What are the advantages of linked list?
How do you represent a linked list?
How do you find the time complexity of a bubble sort?
What is the difference between data types and data structures?
What do you mean by primary clustering?
