Interested to Buy Any Domain ? << Click Here >> for more details...
What is the average number of comparisons in a sequential
search?
- 5 Answers
- 16891 Views
- I also Faced
- E-Mail Answers
Answer Posted / bipin from utkal university mc
suppose there are five element 23,56,78,12,90
minimum time require means searching element present at
first so it takes only one comparison
maximum time require means searching element present at
last so it takes n No. of comparison(here 5 )
so avarage comarison=(1+n)/2
| Is This Answer Correct ? | 10 Yes | 1 No |
Post New Answer View All Answers
Is copyonwritearraylist thread safe?
What are the parts of a linked list?
What is ascii sort order?
Is array a linked list?
What is a data structure? What are the types of data structures?
Why do we use different types of data structures?
How to create an Array?
Why is quicksort faster than merge sort?
What are the disadvantages of sequential storage?
Is hashset synchronized?
Define probing?
What is sorting rule in shapes?
What is array define its types?
Can binary tree have 1 child?
What package is arraylist?
