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
- 33624 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / ntrphanikumar
100 comparisions
since element is not there and the data is unordered we need
to compare with each and every element
| Is This Answer Correct ? | 50 Yes | 7 No |
Post New Answer View All Answers
What is the difference between ienumerable and list?
Does hashmap maintain insertion order?
Define depth and height of a node?
Which interfaces are implemented by abstractsequentiallist?
How do I push an element into a stack?
How will you explain circular linked list?
Can we add heterogeneous elements into treemap?
What is mean by selection sort?
What do you mean by overflow and underflow?
What is the time complexity of arrays sort?
How remove all from arraylist?
What is hashing technique?
State the difference between arrays and linked lists?
Which interfaces are implemented by abstractqueue?
What are linked lists most commonly used for?
