{"id":"sort-string-linear-time","text":"sortString runs in O(n × 26) = O(n) time; each character is appended exactly once across all sweep iterations.","truth_value":"IN","source":"entries/2026/06/06/increasing-decreasing-string-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"sort-string-linear-time","truth_value":"IN","reason":"premise"}]}}