What is the average number of comparisons in a sequential
search?
- 5 Answers
- 15696 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
Which is better bubble sort or selection sort?
Explain what are the major data structures used in the hierarchical data model?
How to find the missing element in integer array of 1 to 7?
How does a dynamic array work?
What are the goals of data structure?
What is the use of hashtable?
What is a 2 dimensional array?
Which sorting is best?
what is traversal in linked lists?
Is arraylist a class?
How does hashset work internally in java?
How do I remove a value from a list?
What is sequential sorting?
Run time memory allocation is known as ?
What is selection sort with example?
