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

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

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

If You Enjoyed This, Take 5 Seconds To Share It

• Facebook
• Twitter
• Google+
• StumbleUpon
• Digg
• Delicious
• LinkedIn
• Reddit
• Technorati