# Unbounded Runtime Growth

> An algorithm whose running time grows without bound as input scales, becoming infeasible at size.

Record: `lexicon:unbounded-runtime-growth`
Kind: anti-pattern
Layer: [Performance Core](https://banes-lab.com/records/layer/performance-core.md)
Canonical: https://banes-lab.com/ontology/lexicon#lexicon-unbounded-runtime-growth

Listed in [Lexicon terms](https://banes-lab.com/api/records/lexicon.md), after [Unbounded Memory Growth](https://banes-lab.com/records/lexicon/unbounded-memory-growth.md) and before [Arrival and Service Rates](https://banes-lab.com/records/lexicon/arrival-and-service-rates.md).

## Category

- [Scalability / Performance / Optimization](https://banes-lab.com/records/lexicon-category/scalability-performance-optimization.md)

## Negated by

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

## Linked from

- [Scalability / Performance / Optimization](https://banes-lab.com/ontology/principles/architecture-category-scalability-performance-optimization.md)
