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
- 35872 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / pavan
100
| Is This Answer Correct ? | 19 Yes | 4 No |
Post New Answer View All Answers
What is numeric array?
When is a binary search best applied?
How to sort 1 million floating point numbers?
What is the best case for bubble sort?
What stack means?
Can hashmap have duplicate keys?
Is arraylist faster than array?
What is the difference between a hashmap and hashtable?
Tell me can the size of operator be used to tell the size of an array passed to a function?
Explain how to find 3rd element from end in a linked list in one pass?
What is difference between an Array and ArrayList?
What is a postfix expression?
How do you find a string is anagram or not?
What are the types of sorting?
What is the prerequisite for binary searching?
