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
- 31811 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Post New Answer View All Answers
Is arraylist synchronized?
What is the best case for bubble sort?
How would you sort words in a large file?
Define threaded binary tree.
What is the two-dimensional array?
What are the complexity of binary search?
Does treemap allow null values?
What is adt in data structure with example?
Define double hashing?
When is a graph said to be weakly connected?
List the differences between comparable and comparator interface?
What is the similarity between a Structure, Union and enumeration?
What is binary tree used for?
How does a selection sort work?
Does treemap allow null key?
