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
- 35493 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
Why is data structure needed?
Is a list an array?
How do you sort a list in reverse order?
What is long data type?
Where the data structures are used?
Explain extended binary tree.
What are the types of binary tree?
Why we use linked list?
Differentiate between iterable and iterator.
Is data structure a data type?
What are the disadvantages of sequential storage?
What are arrays give example?
Can arraylist contain null?
What are the advantages of modularity?
What is a vector element?
