binary search, bias to the right
β’ 36 words β’ 1 min
β’ updated
Prefer:
mid = left + (right - left + 1) // 2
Prefer:
mid = (left + right + 1) // 2
Instead of:
mid = ((left + right) // 2) + 1
Related Posts
Prefer:
python mid = left + (right - left) // 2 Instead of:
python mid = (left + right) // 2 …to avoid a potential integer overflow.
Not a real β¦
Dec 28, 2025
LeetCode #704: Binary Search:
From scratch, iteratively:
python class Solution: def search(self, nums: List[int], target: int) -> int: left = 0 β¦
Jan 03, 2026
Previously, previously, previously, previously, previously.
