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
- 66240 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / sherin
its asked sequential search
if it was binary then dividing array into 2 , then
comparing....100 - 50 - 25 - 12 - 6 - 3 - 1 -then the no.,
i think Dj thought it like that ..
Sequential search is not needed here because the numbers are
ordered , if it was not ordered then 'n' comparisons are
necessary.
question here is not worst case scenario , see its asked
average case ..that too with ordered numbers ...
| Is This Answer Correct ? | 4 Yes | 1 No |
Post New Answer View All Answers
Define leaves?
Differentiate between list and map.
What is definition list?
Will hashmap allow null keys?
What is rule regarding overriding equals and hascode method?
Is bucket sort a comparison sort?
Can hashmap store null values?
What does simulation of queues mean?
What does map stand for?
What do you mean by free pool?
What are the drawbacks of array implementation of queue?
What is the difference between adt and data structure?
Can we store primitives in collections?
Why we need cursor implementation of linked lists?
What is the impact of signed numbers on the memory?
