Software Engineering KB

Home

❯

01 Foundations

❯

02 Computational Complexity

❯

00 Category

❯

Time Complexity

Time Complexity

Feb 10, 20261 min read

  • computational-complexity
  • time-complexity

Time Complexity

Back: Computational Complexity

The amount of time an algorithm takes as a function of its input size. Time complexity provides a framework for comparing algorithms and predicting performance at scale using asymptotic notation.

Concepts

  • Big-O Notation
  • Big-Omega Notation
  • Big-Theta Notation
  • Amortized Analysis
  • Common Classes

computational-complexity time-complexity


Graph View

  • Time Complexity
  • Concepts

Backlinks

  • Amortized Analysis
  • Big-O Notation
  • Big-Omega Notation
  • Big-Theta Notation
  • Common Classes
  • Computational Complexity

Created with Quartz v4.5.2 © 2026

  • GitHub