The average successfull Search time for sequential search on n items is	Pick
A) n/2  B) (n-1)/2  C) (n+1)/2  D) log(n)+1  E) (n)+1
To understand this think as there is an array and now you are searching for an element which is a[0] element in that arrary...so for this you need to do 1 comparison.   Now similarly for sequential searching suppose your are looking for an element which is present at 2nd position i.e a[1] position of that array then you will get answer within 2 comparisons.   Now similarly if you have n elements and your desired element is the nth element then you will have to do n comparisons.   so we can write total search time will be: (1+2+3+........+n)   average search time will be (1+2+3+........+n)/n   NOW we know sum of n natural numbers i.e 1+2+3+.....n= {n(n+1)}/2   ANSWER: (n+1)/2
<result>C</result>
The average successfull Search time for sequential search on n items is