{"id":"left-biased-binary-search-pattern","text":"First-bad-version uses left-biased binary search: when `isBadVersion(mid)` is true, `right = mid` (not `mid - 1`) because `mid` itself may be the answer; when false, `left = mid + 1` since `mid` is definitively excluded.","truth_value":"IN","source":"entries/2026/06/06/first-bad-version-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":["binary-search-variants-share-convergence-structure"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"left-biased-binary-search-pattern","truth_value":"IN","reason":"premise"}]}}