diff --git a/en/codes/python/chapter_divide_and_conquer/binary_search_recur.py b/en/codes/python/chapter_divide_and_conquer/binary_search_recur.py
index eb70629f73..2bd9e9bdc3 100644
--- a/en/codes/python/chapter_divide_and_conquer/binary_search_recur.py
+++ b/en/codes/python/chapter_divide_and_conquer/binary_search_recur.py
@@ -11,7 +11,7 @@ def dfs(nums: list[int], target: int, i: int, j: int) -> int:
     if i > j:
         return -1
     # Calculate midpoint index m
-    m = i + (j - i) // 2
+    m = (i + j) // 2
     if nums[m] < target:
         # Recursive subproblem f(m+1, j)
         return dfs(nums, target, m + 1, j)