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
- 35899 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 |
What are the major data structures used in the rdbms?
A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute?
Why is waste sorting important?
Is stack a dynamic data structure?
Does array sort mutate?
What is data and information explain with example?
What do you mean by priority queue?
How can someone display singly linked list from first to last?
Explain the steps to insert data into a singly linked list?
How do you find the time complexity of a bubble sort?
Which is faster hashmap or hashset?
Does treeset allow duplicates?
Windows 
