The element being searched for is not found in an array of
100 elements. What is the average number of comparisons
needed in a sequential search to determine that the element
is not there, if the elements are completely unordered?
- 11 Answers
- 31755 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / mounesh badiger
we have to check all the elements of the array.so average is
n(size of array)
| Is This Answer Correct ? | 14 Yes | 3 No |
Post New Answer View All Answers
What is difference between list and linked list?
What is a list of lists?
Define the tree data structure.
Which is the parent class of abstractsequentiallist class?
What things you would care about to improve the performance of application if its identified that its db communication that needs to be improved?
What is the Difference between treemap and hashmap?
What is binary search in programming?
Which is best book for data structures?
What is static array?
When is a binary search algorithm best applied?
What is bubble sort with example?
What does stack top do?
What is data structure geeksforgeeks?
Explain what is B-tree?
Does list maintain insertion order?
