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
- 31759 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / anirban lahiri
Allmost 50 comparison's are required. Because if we use
double pointer instead of single pointer and we run the
algo. untill we get that element. But that ele. is not in
that unordered list then the algo will stop and produces
"No match is found", when the pointers are superimpossed to
each other. That is we set an algo. of two pointer's in the
front and rear end and when each time the matching is not
found then one pointer is go on increasing and the other
one is go on decreasing( in location ).
| Is This Answer Correct ? | 6 Yes | 24 No |
Define an abstract data type (adt)?
What is weight balanced tree in data structure?
What do you mean by selection sort?
What is a B tree?
0 Answers Akamai Technologies,
Why do we need algorithm?
Define primary clustering?
What is a minimum spanning tree?
What is the use of bubble sort?
What are the advantages and disadvantages of linked list?
Is hashmap an object?
How to do the intersection of two sorted arrays?
What is a list of lists?
Windows 
