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
- 31878 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
What is a pseudocode example?
What do you mean by overflow and underflow?
Define a queue?
How do you represent a linked list?
Differentiate null and void?
What is fibonacci search?
Define splay tree?
What is stack in data structure with the example?
What are sorting algorithms used for?
What are the parts of a linked list?
What is the best case complexity of quicksort?
Is binary tree balanced?
What does map stand for?
What is the order of selection sort?
What is the difference between array and stack in data structures?
