{"id":"sort-even-odd-time-complexity","text":"Sort-even-odd-indices runs in O(n log n) time dominated by two `sorted()` calls, with O(n) space for partition lists and result.","truth_value":"IN","source":"entries/2026/06/06/sort-even-and-odd-indices-independently-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"sort-even-odd-time-complexity","truth_value":"IN","reason":"premise"}]}}