Question:Let A be a sorted array of n=10 elements. Assume that only one comparison is required to determine whether the target is equal to, less than, or greater than A[i]. Which of the following denotes the average successful time of finding an arbitrary element x in A using the binary search?
A 1.6
B 2.9
C 4.2
D 5.5
+ AnswerB
+ Report