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
- 31742 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
What do you know about different sorting algorithms?
How can I study data structures and algorithms?
Differentiate file structure from storage structure?
What is quick sort?
How do you find the space complexity of a bubble sort?
What are linear and non linear data structures?
Is pointer a variable in data structure?
Which interfaces are implemented by abstractsequentiallist?
What is the difference between classifying and sorting?
How to traverse data in a linked list in forward and backward direction, write the algorithm?
Define shortest path?
What is a bubble sort and how do you perform it?
Which sorting algorithm is considered the fastest?
What do you mean by disjoint set adt?
Describe the complexity of Binary search
