What happens if the element being searched for is not present in the array durin

What happens if the element being searched for is not present in the array during a binary search?

What happens if the element being searched for is not present in the array during a binary search?

Step 1: Start with a sorted array and the element 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: Check if the element at the middle index is equal to the element you are searching for.
Step 5: If it is equal, return the middle index as the position of the element.
Step 6: If the element is less than the middle element, move the right pointer to middle - 1.
Step 7: If the element 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 element is not in the array.
Step 10: Return -1 to indicate that the element is absent.

No concepts available.