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
- 66749 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
What does isempty() member method determines?
Which is the fastest sorting?
What does the term sorting refer to?
Explain Array
Can array store heterogeneous data?
How do signed and unsigned numbers affect memory?
What is a stable algorithm?
How can we reverse a singly linked list?
Write an algorithm to find middle element in the linked list.
Can arraylist hold different types?
How to get a list of tables, views and columns in firebird database?
What are threaded binary trees?
What is difference between concurrenthashmap and hashtable?
What is list and its types?
How do you declare An array of three pointers to chars
