# Time Complexity

Record: `arch:time-complexity`
Kind: metric
Layer: [Performance Core](https://banes-lab.com/records/layer/performance-core.md)
Severity: contextual
Scope: algorithm, function
Canonical: https://banes-lab.com/ontology#arch-time-complexity

## Repair

- Refactored by: Improve Algorithm, Add Index/Cache
- Detected by: nested loops over large inputs, benchmark slope
- Violated by: unacceptable asymptotic runtime
- Measured by: Big O, runtime scaling
- Enforced by: benchmark thresholds

## requires

- [Input Size Model](https://banes-lab.com/records/lex/input-size-model.md)

## reinforces

- [Algorithmic Efficiency](https://banes-lab.com/records/arch/algorithmic-efficiency.md)

## enables

- [Scalability Analysis](https://banes-lab.com/records/lex/scalability-analysis.md)

## conflicts-with

- [Unbounded Runtime Growth](https://banes-lab.com/records/lex/unbounded-runtime-growth.md)

## tensions-with

- [Space Complexity](https://banes-lab.com/records/arch/space-complexity.md)

## tensions

- [Time Complexity Space Complexity](https://banes-lab.com/records/tension/space-complexity-time-complexity.md)

## referenced-by

- [Space Complexity](https://banes-lab.com/records/arch/space-complexity.md)