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
- 31796 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / pankaj
(sum of all 1 to 100) - (sum of given numbers)= number missing
for this no comparison required
| Is This Answer Correct ? | 4 Yes | 20 No |
Post New Answer View All Answers
What are the types of sorting?
Define forest?
How do I rearrange rows in numbers?
Is binary tree balanced?
What are the 3 types of measurement?
Define rehashing?
What is bitonic search?
Can we insert null in set?
What is the Difference between sax and dom parser?
Which interfaces are implemented by enumset?
Define collision in hashing?
What is garbage collection in data structure?
What is the difference between collections class vs collections interface?
Is hashmap synchronized?
What is complete binary tree in data structure?
