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
- 35082 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / poonam
IN sequential search (average case =[1/2(best case)+(wrost case)])...its the formula to calculate the average case of sequential search ...
so best case is when we found the element in first comparison.
worst case is when we found element in 100 comparison.
average case is =1/2(1+100)
ans would be 50.5
| Is This Answer Correct ? | 11 Yes | 5 No |
Post New Answer View All Answers
How do you empty an arraylist?
Write any two principles of gradation of structures.
What is array and structure?
Why do we need algorithm?
Explain quick sort?
What are the advantages and disadvantages of linked list over array?
What is an externalizable interface?
Explain what are the major data structures used in the network data model?
What does abstract data type mean?
Can tuple be sorted?
Are sets sorted?
What does enum do?
Which sorting algorithm is the slowest?
Is hashtable throw concurrentmodificationexception?
How efficient is bubble sort?
