In binary search, what is the purpose of calculating the mid index?

In binary search, what is the purpose of calculating the mid index?

Step 1: Start with a sorted array of numbers.
Step 2: Identify the starting index (left) and the ending index (right) of the array.
Step 3: Calculate the mid index using the formula: mid = (left + right) / 2.
Step 4: The mid index helps to find the middle element of the current search range.
Step 5: Compare the middle element with the target value you are searching for.
Step 6: If the middle element is equal to the target, you found it!
Step 7: If the middle element is less than the target, search in the right half of the array.
Step 8: If the middle element is greater than the target, search in the left half of the array.
Step 9: Repeat the process until you find the target or the search range is empty.

No concepts available.