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
- 35167 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 |
Will hashmap allow null keys?
What is a data structure? What are the types of data structures? Briefly explain them
How hashmap increases its size?
How dynamic arrays are created?
Can a null element added to a treeset or hashset?
Define linked lists?
write a program to accept name & sort them?
Explain what is the bucket size, when the overlapping and collision occur at same time?
Which are the sorted collections?
Why might quick sort might be better than merge sort?
how to add an item to the beginning of the list?
What do you mean by data types?
Windows 
