What happens if the target value is not present in the sorted array during a bin

What happens if the target value is not present in the sorted array during a binary search?

What happens if the target value is not present in the sorted array during a binary search?

Step 1: Start with a sorted array and a target value that you want to find.
Step 2: Set two pointers, one at the beginning of the array (left) and one at the end (right).
Step 3: Calculate the middle index of the array using the formula: middle = (left + right) / 2.
Step 4: Compare the value at the middle index with the target value.
Step 5: If the middle value is equal to the target, return the index of the middle value.
Step 6: If the middle value is less than the target, move the left pointer to middle + 1.
Step 7: If the middle value is greater than the target, move the right pointer to middle - 1.
Step 8: Repeat steps 3 to 7 until the left pointer is greater than the right pointer.
Step 9: If the target value is not found after the loop ends, return -1 or a similar indicator of absence.

No concepts available.