What will be the output of binary search if the target element is not present in

What will be the output of binary search if the target element is not present in the array?

What will be the output of binary search if the target element is not present in the array?

Step 1: Start with a sorted array and a target element that you want to find.
Step 2: Set two pointers, one at the beginning (left) and one at the end (right) of the array.
Step 3: Calculate the middle index of the array using the formula: middle = (left + right) / 2.
Step 4: Compare the middle element with the target element.
Step 5: If the middle element is equal to the target, return the middle index.
Step 6: If the middle element is less than the target, move the left pointer to middle + 1.
Step 7: If the middle element 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 element is not found after the loop, return -1 to indicate that the target is absent.

No concepts available.