Interested to Buy Any Domain ? << Click Here >> for more details...
What is the average number of comparisons needed in a
sequential search to determine the position of an element in
an array of 100 elements, if the elements are ordered from
largest to smallest?
- 19 Answers
- 67405 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / tej pratap
it should be (100+1)/2.
| Is This Answer Correct ? | 12 Yes | 3 No |
Post New Answer View All Answers
Is linked list faster than array?
Is bubble sort adaptive?
Is hashmap synchronized?
Does set allow null values?
Is bucket sort a comparison sort?
Where is insertion sort used?
Write the stack overflow condition.
What is a treemap used for?
which is the simplest file structure? (Sequential, indexed, random)
How to do the intersection of two sorted arrays?
Describe tree database. Explain its common uses.
What are all the classes and interfaces that are available in the collections?
What happens if we put duplicate key in hashmap?
What is ds tree?
Is python good for freshers?
