The worst case complexity of binary search matches with ...............
A. interpolation search
B. linear search
C. merge sort
D. none of the above
Answer:B
The worst case complexity of binary search matches with ...............
A. interpolation search B. linear search C. merge sort D. none of the above