{"id":"merge-stable-ordering","text":"`merge_two_lists` is a stable merge: when both lists contain equal values, `list1`'s node appears first in the output due to the `<=` comparison.","truth_value":"IN","source":"entries/2026/06/06/merge-two-sorted-lists-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":["merge-paradigm-linear-via-pointer-advancement"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"merge-stable-ordering","truth_value":"IN","reason":"premise"}]}}