what is a complexity of linear search,binery search?
Answer Posted / naresh kumar
complexity of linear search 0
n binary search 0log(n)
| Is This Answer Correct ? | 14 Yes | 31 No |
Post New Answer View All Answers
Differentiate between queue and stack.
What are b tree keys?
Why linked lists are better than arrays?
What can be stored in an arraylist?
Does hashmap allow null keys?
Where the data structures are used?
In what scenario, binary search can be used?
What is difference between array and string?
What do you mean by hash table?
Construct a doubly linked list using a single pointer in each node?
Can tuple be sorted?
Why is map not a collection?
What is mean by selection sort?
Can a tree be empty?
Why is data structure important?