Big O Notation
Version 1.0.0 · Updated 2026-07-30
CORE DEFINITION
Used to describe the trend of algorithm performance as input data size grows (e.g., O(1) is constant, O(n) is linear, O(n²) is quadratic). It focuses on performance at the 'scale limit'.
SCAFFOLDING EFFECT
Reduce cognitive load
Evaluate system scalability. When designing a business model or workflow, ask yourself: when users/tasks increase 10x or 100x, will my costs grow linearly (overwhelmed), exponentially (collapse), or logarithmically/constantly (easy)?
Anchor fast decisions
Big O notation describes the asymptotic upper bound of time/space as input size grows, ignoring constants and focusing on the order of growth. The mechanism is to compare algorithm scalability by growth order.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Big_O_notationverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS