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
- 31877 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 |
Explain the term binding time?
What is the difference between length () and size () of arraylist?
Can you store different types in an array?
What is the relationship between a queue and its underlying array?
Define linear probing?
What is adt in data structure with example?
Does treemap allow null keys?
What is hash value of a string?
Why do we need to use computers to help us sort lists?
What is ascending and descending order?
Why do we need a data structure?
Write the recursive c function to count the number of nodes present in a binary tree.
Windows 
