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
- 35246 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / siya
100 comparisons
| Is This Answer Correct ? | 7 Yes | 3 No |
Post New Answer View All Answers
Is map a collection?
Name some applications which use linked lists.
Is vector synchronized?
What are the advantages of bubble sort?
Can map contain duplicate keys?
How does insertion sort works?
Where is data structure used?
Can we null keys in treemap?
Describe full binary tree and complete binary tree.
If we add enum constants to a sorted collection ( treemap , treeset ), what will be the order in which they will be maintained?
What is thread and types of thread?
What is Doubly link list?
Can we define the size of arraylist?
How do you find the number of comparisons in bubble sort?
How do signed and unsigned numbers affect memory?
