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
- 35149 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
Which is faster array or linked list?
What is sorting rule in shapes?
What is list and types of list?
Is treemap synchronized?
How do you sort in ascending order in arraylist?
Explain the term base case?
What is the default size of an arraylist?
Is array static or dynamic?
What is an object array?
What is the difference between file structure and storage structure?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
Write program for Quick sort ?
Define double linked list?
What is the difference between Array and Array List ? Explain in brief with example.
which notations are used in evaluation of arithmetic expressions using prefix and postfix forms?
