{"id":"binary-search-closed-interval-style","text":"The binary search implementation uses closed-interval bounds `[left, right]` with `while left <= right`, where both endpoints are inclusive candidates — not the half-open `[left, right)` alternative.","truth_value":"IN","source":"entries/2026/06/06/binary-search-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"binary-search-closed-interval-style","truth_value":"IN","reason":"premise"}]}}