Interested to Buy Any Domain ? << Click Here >> for more details...
What is the average number of comparisons in a sequential
search?
- 5 Answers
- 16813 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 array and its types?
What is comparable interface?
Who created quicksort?
Does arraylist shrink?
How to use appendNode() in linkedlist()?
What do you mean by secondary clustering?
What do you mean by back edge?
What are the different types of hash functions?
Which sorting algorithm is best for large data?
Does treeset remove duplicates?
Define graph?
What are the types of queues?
Explain different methods in which you can traverse a tree?
Define an abstract data type (adt)?
What is a b+ tree? Explain its uses.
