{"id":"sort-by-parity-linear","text":"The parity-sort algorithm runs in O(n) time with O(1) extra space via a single converging two-pointer pass.","truth_value":"IN","source":"entries/2026/06/06/sort-array-by-parity-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"sort-by-parity-linear","truth_value":"IN","reason":"premise"}]}}