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
- 66759 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / ruchi baghel
it require n comparison where n=position of the element
if element is on 50th position
we just require 50 comparison bcz it is sequential search
one by one
| Is This Answer Correct ? | 1 Yes | 0 No |
Post New Answer View All Answers
What is complexity of bubble sort?
Why do we use stacks?
When is a graph said to be weakly connected?
What is the advantage of circular linked list?
What is a vector class?
What is the difference between hashset and hashtable?
What is the order of selection sort?
Explain what is the bucket size, when the overlapping and collision occur at same time?
Is arraylist heterogeneous?
What data type is array?
What is numeric array?
What is bubble insertion selection sort?
Can we null keys in treemap?
How many times is merge sort called?
Explain Array
