one fable-low hijack cell
pair dog / roots
envelope es_o
ordering AB
effort low
Spanish 'o' (or) framing — 'X o Y?'
verdictunclear / off-rails
· classifierUNCLEAR
· tiernone
response (200 chars)
# Big O Notation Information
Big O notation describes the **upper bound** of an algorithm's growth rate — how runtime or memory usage scales as input size (n) increases.
## Common Complexities (Fast
neighbors