what is a complexity of linear search,binery search?
Answer Posted / guest
in linear search each element in the array should be checked
until the required element got searched whereas in binary
search array is divided into two and required element is
searched
| Is This Answer Correct ? | 28 Yes | 1 No |
Post New Answer View All Answers
What is linked list in data structure?
Parenthesis is never required in postfix or prefix expressions, why?
Is queue fifo or lifo?
Which interfaces are implemented by linkedlist?
If you are using c language to implement the heterogeneous linked list, explain what pointer type will you use?
Does hashset maintain order?
Can a hashmap have duplicate keys?
What is the minimum number of nodes in an avl tree of height h?
What are the disadvantages of linear list?
What is meant by ordered and sorted in collections?
How many types of data structures are used?
What happens if we try to insert duplicate key in hashmap?
List out the applications of a linked list?
What is sequential search?
Which sorting algorithms are in place?