The element being searched for is not found in an array of
100 elements. What is the average number of comparisons
needed in a sequential search to determine that the element
is not there, if the elements are completely unordered?
- 11 Answers
- 31694 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / tarzan
Answer i think is
u require 1,2,3,...,100(max) to search an element because it
is unsorted
i assume it to be random seq of number so we hav to search
until we find the required no
so if all input ie search request is a hit then avg is
50.5=~51 (1+2+..+100/(2*100))
and if search has misses den worst is de case i.e mean will
shift towards 100 but always less than 100 bcoz it is
unrealistic to say de search is alwayz miss
| Is This Answer Correct ? | 23 Yes | 2 No |
Post New Answer View All Answers
How do you sort large data?
What is garbage collection in data structure?
What is the difference between list and arraylist?
What do you mean by sorting?
What is heap tree in data structure?
What is difference between for loop and foreach?
Are collections thread safe?
Is queue fifo or lifo?
Difference between calloc and malloc ?
Why heap sort is not used?
what is Linked lists?
What is the use of heap sort?
Is array size dynamic or fixed?
What do you mean by union-by-weight?
What are the advantage of collection classes over arrays?
