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
- 66762 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / gianni
the above answer of n+1/2 is correct if you assume it will
always be a successful search. you also need to take into
account the probability of the item NOT being in the list.
as such your final formula is actually
p/n * n(n+1)/2 + n(1-p) where p is the probability that the
item is in the list. That formula can be reduced ton(1-p/2)+p/2
assuming a probability of .5, you wind up with an answer of
(3n+1)/4 or ~3/4 of the list will be searched on average.
| Is This Answer Correct ? | 0 Yes | 2 No |
Post New Answer View All Answers
Can we put null value in hashmap?
Define outdegree of a graph?
How is heap sort implemented?
In rdbms, explain what is the efficient data structure used in the internal storage representation?
Differentiate between hashmap and hashtable.
Do all declaration statements result in a fixed reservation in memory?
How can avl tree be useful in all the operations as compared to binary search tree?
What are the major data structures used in the following areas : network data model & hierarchical data model?
What is a singletonlist?
Will arraylist maintain insertion order?
Why is quicksort so fast?
What are the applications of linked list?
Is queue fifo or lifo?
What are the advantage of collection classes over arrays?
How to get largest and smallest number in an array?
