Refactor mid calculation to prevent overflow

MahbubHS · web-flow · commit 86fdac9f1dc7 · 2025-12-08T15:09:07.000+06:00
diff --git a/pygorithm/searching/binary_search.py b/pygorithm/searching/binary_search.py
@@ -32,7 +32,7 @@ def search(_list, target):
     try:
         # you can also write while True condition
         while left <= right:
-            mid = (left + right) // 2
+            mid = left + (right - left) // 2
             if target == _list[mid]:
                 return mid
             elif target < _list[mid]:
