What will be the result of a binary search if the target value is not present in

What will be the result of a binary search if the target value is not present in the array?

What will be the result of a binary search if the target value is not present in the array?

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 middle index (the target is found).
Step 6: If the middle value is less than the target, move the left pointer to middle + 1 (search the right half).
Step 7: If the middle value is greater than the target, move the right pointer to middle - 1 (search the left half).
Step 8: Repeat steps 3 to 7 until the left pointer is greater than the right pointer.
Step 9: If the left pointer exceeds the right pointer, it means the target value is not in the array.
Step 10: Return -1 to indicate that the target value is absent.

No concepts available.