Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 35087 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 ? | 24 Yes | 2 No |
Post New Answer View All Answers
Define a tree?
Sorting is not possible by using which of the methods?
Can constructor be static?
Can tuple be sorted?
What is linked list ?
What does a bubble chart show?
How do you explain bubble sort?
How do you find the complexity of a bubble sort?
What is garbage collection in data structure?
What is the heap in data structures?
What is the use of data structure in real life?
What is the use of treemap?
Why hashtable is faster than arraylist?
Which is better array or linked list?
What is the idea behind splaying?
