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).

❥╬٨ـﮩﮩ❤٨ـﮩﮩـ╬❥Give me Correct Answer​

Answer 1

Answer:

❥• 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).

Step-by-step explanation:

d

Answer 2

$❣{\huge{\underline{\small{\mathbb{\pink{YOUR \ CORRECT \ ANSWER \ }}}}}}$