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
- 35216 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 adt and its advantages?
Why hashmap is faster than hashset?
Explain what is linear search?
What is a simple graph?
Two linked lists are given, find out the sum of them without altering the linked list?
Can you make an arraylist of arrays?
What is priority queue in data structure?
What stack means?
Explain binary representation?
What is meant by a dynamic array?
Can hashset contain duplicates?
What is the difference between static and dynamic data?
Where is data structure used?
What does simulation of queues mean?
Which interfaces are implemented by linkedlist?
