Question

In Binary Search , which will be the scenario for Average Case performance ?

A. The 'Mid key’ is present, but it’s not the middle element O(logn).
B. The ‘input key’ is present, but it’s not the middle element O(logn).
C. The ‘Last key’ is present, but it’s not the middle element O(logn).
D. The ‘First key’ is present, but it’s not the middle element O(logn).​

Answer 1

Answer:

The 'input key' is present, but it's not the middle element O(logn). Explanation: In binary search, there is an array containing multiple set of numbers. hope it helps you see the attachment too