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

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

What will be the result 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: Check if the element at the middle index is equal to the target element.
Step 5: If it is equal, return the middle index (the target is found).
Step 6: If the target is less than the middle element, move the right pointer to middle - 1.
Step 7: If the target is greater than the middle element, move the left 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 left pointer exceeds the right pointer, it means the target element is not in the array.
Step 10: Return -1 to indicate that the target element is absent.

No concepts available.