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
- 35204 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
Can you distinguish between ArrayList and Array?
What is the difference between a hashmap and hashtable?
What is the need for path compression?
How do you empty an arraylist?
State the advantages of using infix notations?
How many pointers are necessary to implement a simple linked list?
What is impact of signed numbers on the memory?
How can we delete the first node from the singly linked list?
Explain the types of linked lists.
Is linked list faster than array?
What is binary tree and its types?
Can we store null in arraylist?
For addition and deletion. Which one is most preferred: array list or linked list?
What is an ordered map?
What is the space complexity of selection sort?
