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
- 31740 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
Is map a data structure?
In what areas do data structures are applied?
What is the quickest sorting algorithm?
What is the minimization factor and time complexity of b-tree?
What is 2 dimensional linked list?
What are the types of map?
Which is best book for data structures?
How many types of search algorithms are there?
What are the tasks performed during postorder traversal?
What is modcount in hashmap?
What is the time complexity of arrays sort?
How to copy an array into another array?
Explain circular linked list?
Describe tree database. Explain its common uses.
What data structure does a binary tree degenerate?
