Interested to Buy Any Domain ? << Click Here >> for more details...
What is the average number of comparisons in a sequential
search?
- 5 Answers
- 16863 Views
- I also Faced
- E-Mail Answers
Answer Posted / kalyani
Searching an element in an array, the search starts from the first element till the last element the average number of comparisons in a sequential search is (N+1)/2,where N is the size. The number of comparisons will be 1, if element is in the first position and if element is in the last position the number of comparisons will be N.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is the difference between data type and data structure?
What is linked list with example?
Is red black tree balanced?
What method is used to place a value onto the top of a stack?
What data structure underlies a python list?
What is the space complexity of quicksort?
What are the types of array operations?
What are different types of linked lists?
What is dynamic array in excel?
What is map data structure?
Can map contain duplicate keys?
What type of variable is age?
Why is data structure needed?
What is meant by heap sort?
What are types of Collision Resolution Techniques and the methods used in each of the types?
