what is a complexity of linear search,binery search?
Answer Posted / hemant belwal
linear search=n/2
binary search=iog2n,2 in the base of log.
| Is This Answer Correct ? | 36 Yes | 91 No |
Post New Answer View All Answers
What is the prerequisite for binary searching?
For addition and deletion. Which one is most preferred: array list or linked list?
Explain different methods in which you can traverse a tree?
State the merits of linear representation of binary trees?
Can map contain duplicate keys?
what is the difference between dynamic as well as non - dynamic data structures.
What are the classification of data structures?
If you are given a choice to use either arraylist and linkedlist, which one would you use and why?
How to copy an array into another array?
Where is insertion sort used?
Is char array null terminated?
What is impact of signed numbers on the memory using data structures?
Differentiate between arraylist and linkedlist.
How does arraylist store data?
Why is hashmap faster than arraylist?