Big O Notation

The classification of algorithms by how their cost grows with input size, ignoring constants and small cases.

Core Principles & Analysis

• The notation comes from number theory; Knuth popularized O-notation for algorithms in 1976.
• An O(n log n) sort and an O(n²) one differ by hours versus centuries at scale.
• Big O describes the ceiling of growth; Big Theta its tight bound.