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
- 35494 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
What is binary tree and its types?
Explain recursive function & what is the data structures used to perform recursion?
how to delete first node from singly linked list?
Is bubble sort slow?
Why are b trees used?
What is difference between arraylist and linkedlist?
What is a vector element?
What sorting algorithm should be used for sorting strings?
How does dynamic memory allocation help in managing data?
How to print element of Array?
Which sorting algorithm has minimum number of swaps?
What does sorting an array do?
What is height balanced tree?
Which is best array or linked list?
How do you declare An array of three pointers to chars
