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

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

The middle element is equal to the ‘input key’ O(2). The middle element is equal to the ‘input key’ O(1). The middle element is equal to the ‘input key’ O(4). The middle element is equal to the ‘input key’ O(3).

If You Enjoyed This, Take 5 Seconds To Share It

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