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
- 35552 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
How many types of searching are there in data structure?
Difference between abstract data type, data type and data structure?
How do you do a mergesort?
How to reverse a linked list iterative algorithm?
What is difference between list and array?
Can you list out the areas in which data structures are applied extensively?
What are linked lists used for?
Explain the term tail recursion?
Why is hashmap faster than arraylist?
What is array sort?
What is the impact of signed numbers on the memory?
What is the maximum size of array?
Define left-in threaded tree?
Why quicksort is called quick?
Why merge sort is better than insertion sort?
