In binary search, average number of comparison required for searching an element in a list if n numbers is:
A. log2 n
B. n / 2
C. n
D. n – 1
Answer:A
In binary search, average number of comparison required for searching an element in a list if n numbers is:
A. log2 n B. n / 2 C. n D. n – 1