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
- 35557 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 hashing in cyber security?
Is data structures and algorithms important?
In tree construction which is the suitable efficient data structure?
Can we store null in arraylist?
What is data structures in computer science?
What is fibonacci search?
Describe the complexity of Quick Sort
How can you insert a node to the beginning of a singly linked list?
What are the advantages of selecetion sort?
What are the different types of collections?
What is a vector class?
Write an algorithm to show the reverse of link list?
How do you declare An array of three pointers to chars
What is the quickest sorting algorithm?
Is it possible to make an array volatile in java?
