Algorithmic Efficiency

Kind: principle

Layer: Performance Core

Record: architecture:algorithmic-efficiency

Severity: contextual

Scope: algorithm, data structure

Canonical: Ontology

A design rule that an algorithm and its data structures are chosen for how their cost grows with input size.

Listed in Architecture principles, after Performance Engineering and before Time Complexity.

Requires

• Complexity Awareness

Reinforces

• Scalability

Enables

• Efficient Processing

Conflicts with

• Inefficient Algorithm Choice
• N Plus One Query

In tension with

• Implementation Simplicity

Tensions

• Algorithmic Efficiency / Implementation Simplicity

Violated by

• Inefficient Algorithm Choice

Refactored by

• Replace Algorithm
• Add Index

Severity

• contextual

Category

• Scalability / Performance / Optimization

Enforced by

• rules/eslint/no-linear-scan-lookup.eslint.rule.ts

Reinforced by

• Time Complexity
• Big O Notation

Linked from

• Anti-patterns
• Scalability / Performance / Optimization
• Scalability / Performance / Optimization
• Severity levels
• The resolutions