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
- 67475 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / ranjit
Gianni, Your answer would be correct if the list was unordered. Since it is a sorted list (descending order), one does not have to go through the whole list in order to determine that the element is not present. Thus, the problem is to simply traverse the list until you find a number <= the number, x, you are looking for. This can be done with (n+1)/2 comparisons on average. Probability of x being present in the list is not a factor.
Shyam, as I explained in the above para, the fact that the list is sorted is relevant. If it was unsorted, Gianni would be absolutely right.
| Is This Answer Correct ? | 0 Yes | 1 No |
Post New Answer View All Answers
Is arraylist faster than array?
Does list maintain insertion order?
What is data structure and its operations?
Can arraylist store objects?
What are priority queues?
Explain what is the data structures used to perform recursion?
What is the minimization factor and time complexity of b-tree?
What is a 2 dimensional array?
List out a few of the applications that make use of Multilinked Structures?
Define a tree?
What is top in stack?
What is peep stack?
Define adjacent nodes?
If we try to add duplicate key to the hashmap, what will happen?
What is a string or array type?
