{"id":"sorted-rotated-at-most-one-break","text":"A non-decreasing array rotated by any number of positions has at most 1 index where `nums[i] > nums[(i+1) % n]`; the algorithm makes exactly `n` circular comparisons (not `n-1`) to include the wrap-around.","truth_value":"IN","source":"entries/2026/06/06/check-if-array-is-sorted-and-rotated-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"sorted-rotated-at-most-one-break","truth_value":"IN","reason":"premise"}]}}