Big O Notation

Kind: technique

Layer: Performance Core

Record: architecture:big-o-notation

Severity: contextual

Scope: algorithm

Canonical: Ontology

A method for classifying an algorithm by the upper bound on how its cost grows with input size, ignoring constant factors.

Listed in Architecture principles, after Space Complexity and before Optimization.

Requires

• Complexity Model

Reinforces

• Algorithmic Efficiency

Enables

• Comparative Analysis

Conflicts with

• Anecdotal Performance Claims

In tension with

• Constant-Factor Practicality

Tensions

• Big O Notation / Constant-Factor Practicality

Violated by

• Inefficient Algorithm Choice

Refactored by

• Replace Algorithm

Severity

• contextual

Category

• Scalability / Performance / Optimization

Linked from

• Scalability / Performance / Optimization
• Scalability / Performance / Optimization
• Severity levels
• The resolutions