what is a complexity of linear search,binery search?
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
Why heap sort is not used?
Define an abstract data type (adt)?
Can we define the size of arraylist?
List the data structures which are used in hierarchical data model.
What is ds heap sort?
When will we get ArrayStoreException?
Is priority queue sorted?
Which interfaces are implemented by printerstatereasons?
How to sequentially represent max-heap?
Define a linear and non linear data structure.
Is learning data structures necessary?
Write a program for Sorting an Array. Which sorting will you prefer?
What is difference between tree and forest?
State the difference between queues and linked lists?
How do you find the index of an element in an arraylist?