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
- 61140 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
Which collection is used for sort?
How do stacks work?
What is ordered map?
What data type is array?
What is the time complexity of hashmap get () and put () method?
Mention for which header list, you will found the last node contains the null pointer?
What is a postfix expression?
How efficient is bubble sort?
What is a B tree?
What is the best sorting technique?
What is data structure what is need of it?
Why is quicksort unstable?
Why merge sort is better than insertion sort?
Explain what is the bucket size, when the overlapping and collision occur at same time?
Why is hashset not ordered?
