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?
Answer Posted / pavan
100
| Is This Answer Correct ? | 19 Yes | 4 No |
Post New Answer View All Answers
Is arraylist better than array?
Why do we need to recycle?
What is array in data structure with example?
What is the complexity of selection sort?
List out the basic operations that can be performed on a stack?
What is linear-logarithm chasm?
What is the limit of arraylist?
What is the advantage of circular linked list?
What is difference between data type and data structure?
Do all declaration statements result in a fixed reservation in memory?
State the properties of a binary tree?
What do you mean by the term “percolate up”?
What is dynamic array in excel?
Differentiate between the singly linked list and doubly linked list.
What is peek in stack?