Average successful search time for sequential search on 'n' items is
| A. | n/2 |
| B. | (n-1)/2 |
| C. | (n+1)/2 |
| D. | None of these |
Answer : C Explanation :
If search key matches the very first item, with one comparison we can terminate. If it is second, two comparisons, etc.
Average =[ n (n + 1) ] / 2
|
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
