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
- 31790 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
How does quicksort partition work?
What is array simple?
How dynamic arrays are created?
Which sorting algorithms are in place?
How do we search a specific element in an array?
How do you rotate an AVL tree?
What is the difference between array sort () and array sort t >()?
What is modcount in hashmap?
What are priority queues?
Is bubble sort slow?
What actions are performed when a function is called?
Explain the types of linked lists.
How can we reverse the order in the treemap?
Are linked lists considered linear or non-linear data structures?
Explain about map and their types?
