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
- 35481 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
Does arraylist maintain insertion order?
What is data structure definition?
What are linked lists good for?
How to traverse data in a linked list in forward and backward direction, write the algorithm?
What is sequential search?
What is sequential mapping in data structure?
What are the advantage of linked list over array?
What is the family trees and connection by clause?
What is a map programming?
Define hash function?
What is meant by a dynamic array?
What is the best case complexity of quicksort?
Which sorting is best and why?
What is top in stack?
Can you use Bubble Sort To sort the number of elements.
