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
- 35898 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
What is a subtree?
What is hash data type?
What are the applications of linked list?
Will this code give error if I try to add two heterogeneous elements in the arraylist? And why?
Can we use ordered set for performing binary search?
What is the difference between null and void?
We know that Arrays are objects so why cannot we write strArray.length()?
How do we find duplicate elements in an array?
What is sort in data structure?
What is a vector class?
Which sorting is best?
What are the types of map?
How efficient is bubble sort?
Why is quicksort better than mergesort?
what is the difference between singly and doubly linked lists?
