cs-complexity-analysis
- Propósito: Analyze algorithmic complexity — time, space, amortized cost, and lower bounds — with explicit assumptions and proof sketches.
- Contenido sugerido: asymptotic bounds, trade-offs, and proof strategy.
- Estado: defined as a practical CS specialization.