Queues Q.62
0. The average successful search time for sequential search on 'n' items is
- Option : C
- Explanation : If the search key matches the very first item, with one comparison we can terminate. If it is second, two comparisons , etc. So, average is (1+2+...+n)/n .i.e. (n+1)/2
