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
If you are using c language to implement the heterogeneous linked list, what pointer type should be used?
Is array a data structure?
Is list a data structure?
What is a hash index?
Why sorting is done?
What is time and space complexity of bubble sort?
How can I search for data in a linked list?
Which data structure is used to perform recursion?
Describe full binary tree and complete binary tree.
What is data and information explain with example?
What is impact of signed numbers on the memory?
Write the algorithm for converting infix expression to postfix expression?
Can we extend an array after initialization?
Is sorting a math skill?
Can tuple be sorted?