{"id":"distance-value-sort-bisect-complexity","text":"`findTheDistanceValue` runs in O(m log m + n log m) time via sort + binary search, versus O(n*m) for brute-force nested loop.","truth_value":"IN","source":"entries/2026/06/06/find-the-distance-value-between-two-arrays-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"distance-value-sort-bisect-complexity","truth_value":"IN","reason":"premise"}]}}