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
- 31738 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / pavan
100
| Is This Answer Correct ? | 18 Yes | 4 No |
Post New Answer View All Answers
What is selection in an algorithm?
What is the best case time complexity of bubble sort?
What is collections singletonmap?
Can you make an arraylist of arrays?
Does arraylist maintain insertion order?
Define terminal nodes in a tree?
Define level of the tree?
Define threaded binary tree. Explain its common uses
Explain the uses of matrix with an example?
What is heap and its types?
What is the difference between array list and vector list?
Can we sort hashmap?
What is a postfix expression?
Can tuple be sorted?
What is a reverse linked list.
