The average time required to perform a successful sequential search for an element in an array A (1 : n) is given by
A. | (n+1)/2 |
B. | n (n + 1)/2 |
C. | log(n/2) |
D. | n2 |
Answer : A Explanation : |
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |