When implementing binary search, a common mistake is calculating the midpoint as:mid = (low + high) / 2;
At first glance, this might seem correct and intuitive. However, this approach can lead to a critical bug.
To avoid this, use the safer formula: ...
