Assertion: algorithm's complexity | /r/HasProperty | assumption
Facets:
Source sentences:
text: Complexity and running time Factors: algorithmic complexity, startup costs, additional space requirements, use of recursion (function calls are expensive and eat stack space), worst-case behavior, assumptions about input data, caching, and behavior on already-sorted or nearly-sorted data Worst-case behavior is important for real-time systems that need guaranteed performance.