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
- 35085 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / shailesh pratapwar
The avrage case complexity of any linear search alogrithm is
n/2.
So we need 50 comparisons to search in 100 elements.
| Is This Answer Correct ? | 1 Yes | 2 No |
Post New Answer View All Answers
What is frozenset?
Differentiate between list and set.
Define linked list data structure.
Is linked list faster than array?
Does arraylist guarantee insertion order?
What are scalar values?
What are trees in data structures?
What is array and its types with example?
Define balancing condition for AVL Tree.
How does a selection sort work?
Is python good for freshers?
What do you mean by Logical Error
How do you find the space complexity of a bubble sort?
Can we insert null in list?
Treemap orders the elements on which field?
