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
- 31797 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 ? | 46 Yes | 6 No |
Post New Answer View All Answers
Can we search the data in a linked list?
What is difference between hashmap and linkedhashmap?
What is 1d array?
Differentiate between file and structure storage structure.
What is the height of binary tree?
Is it possible to insert different type of elements in a stack? How?
How do we find duplicate elements in an array?
Which is the parent class of deque
List the applications of queues?
What is the minimum number of queues needed when implementing a priority queue?
Does mentioning the array name gives the base address in all the contexts?
How to find if linked list has loop?
Does arraylist contain duplicates?
List out the disadvantages of using a linked list?
What are AVL trees?
