{"id":"ordered-stream-amortized-linear","text":"Total pointer movement across all n `insert` calls on `OrderedStream` is O(n), making each insert O(1) amortized despite the inner while loop.","truth_value":"IN","source":"entries/2026/06/06/design-an-ordered-stream-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"ordered-stream-amortized-linear","truth_value":"IN","reason":"premise"}]}}