Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 35512 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 are the operations that can be performed on a stack?
Which is faster array or list?
What do you mean by articulation point?
Provide an algorithm to reverse a linked list without using recursion.
What is a property class?
How does a heap sort work?
What is the space complexity of bubble sort?
What are doubly linked lists?
Why is data structure important?
What are the categories of avl rotations?
What is ascending and descending order?
What does adt stands for?
What are the advantage of linked list over array?
Can treeset contain null?
Explain singly linked list in short.
