Interested to Buy Any Domain ? << Click Here >> for more details...
What is the average number of comparisons in a sequential
search?
- 5 Answers
- 16630 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
Which is faster hashmap or treemap?
What is pivot in quicksort?
What is a string or array type?
Why use a tuple instead of a list?
What is the default size of arraylist?
Explain the term tail recursion?
Why it is important to have aligned addresses? What is the exception generated when there is a misaligned address?
Is merge sort better than quick?
Define an abstract data type (adt)?
Differentiate between list and map.
Can you distinguish between ArrayList and Array?
State the merit of linked representation of binary trees?
Does hashmap maintain insertion order?
What do you mean by secondary clustering?
Why is sorting necessary?
