From 86fdac9f1dc7e6206c3433770a8b7806e5db720c Mon Sep 17 00:00:00 2001
From: MD Mahbub Hasan Shad <137253486+MahbubHS@users.noreply.github.com>
Date: Mon, 8 Dec 2025 15:09:07 +0600
Subject: [PATCH] Refactor mid calculation to prevent overflow

Refactor mid calculation to prevent overflow
---
 pygorithm/searching/binary_search.py | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/pygorithm/searching/binary_search.py b/pygorithm/searching/binary_search.py
index 666efa1..64ac155 100644
--- 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]: