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
- 35900 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / tek002
The question is asking for the average number of
comparisons, not the particular realization... On average
you need 50 comparisons since the element you are searching
could just as likely be at the end of the array, as in the
beginning of the array. (for a brute force sequential
search)
If you really want to be fancy, you can actually do it with
10 (sqrt(N)) steps. Since a comparison search is an oracle
based search, you can implement the Grover's Algorithm
which is a unsorted database searching algorithm which is
the best known oracle based search for unsorted databases
(in fact is is provably the best oracle based search for
unsorted arrays).
| Is This Answer Correct ? | 3 Yes | 4 No |
Post New Answer View All Answers
In what order the elements of a hashset are retrieved?
What are two types of sorting?
Are lists mutable?
Explain singly linked list in short.
What is the difference between b tree and binary search tree?
Can a null element added to a treeset or hashset?
Can hashmap store null values?
an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).
Which sorting has less time complexity?
Define general trees?
What is data type explain?
What is basic data structure?
What is a data structure node class?
What is the order of b tree?
What is default size of hashmap?
