If the array is [1, 2, 3, 4, 5] and we search for 6, what will be the final resu

If the array is [1, 2, 3, 4, 5] and we search for 6, what will be the final result of binary search?

If the array is [1, 2, 3, 4, 5] and we search for 6, what will be the final result of binary search?

Step 1: Understand the array [1, 2, 3, 4, 5].
Step 2: Identify the target number 6.
Step 3: Set left pointer at index 0 and right pointer at index 4.
Step 4: Calculate middle index: (0 + 4) / 2 = 2 (middle value is 3).
Step 5: Compare middle value 3 with target 6. They are not equal.
Step 6: Since 3 < 6, move left pointer to index 3.
Step 7: Calculate new middle index: (3 + 4) / 2 = 3 (middle value is 4).
Step 8: Compare middle value 4 with target 6. They are not equal.
Step 9: Since 4 < 6, move left pointer to index 4.
Step 10: Calculate new middle index: (4 + 4) / 2 = 4 (middle value is 5).
Step 11: Compare middle value 5 with target 6. They are not equal.
Step 12: Since 5 < 6, move left pointer to index 5.
Step 13: Left pointer is now greater than right pointer, so 6 is not in the array.
Step 14: Return -1 to indicate 6 is not found.

Binary Search – A search algorithm that finds the position of a target value within a sorted array by repeatedly dividing the search interval in half.