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
- 31867 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
Is Arraylist faster than Array? Why?
How to compare Two Arrays?
What is a simple path?
Explain the internal working of a hash map?
Can sets contain duplicates?
Write an algorithm to show the reverse of link list?
Can we change load factor of hashmap?
Define a complete binary tree?
How do you sort a collection in descending order?
What is meant by deque?
Does hashmap allow null keys?
Given an unsorted linked list, and without using a temporary buffer, write a method that will delete any duplicates from the linked list?
What is the heap in data structures?
What are b tree keys?
What are the tasks performed during preorder traversal?
