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
- 33608 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / mounesh badiger
we have to check all the elements of the array.so average is
n(size of array)
| Is This Answer Correct ? | 14 Yes | 3 No |
Post New Answer View All Answers
Which are the sorted collections?
State the properties of b tree.
What is scalar data type?
Why is arraylist used?
Which sorting technique is faster?
Can we create a null as a key for a map collection?
What are basic algorithms?
How would you sort words in a large file?
Does map extend iterable?
Can an arraylist be null?
Which is better than array and linked list?
Why quicksort is better than merge sort?
Is sorting a math skill?
Write the steps involved in the insertion and deletion of an element in the stack.
What is comparable interface?
