Time Complexity

Quantity

Definition

Time complexity is the computational complexity that describes the amount of time it takes to run an algorithm. It is commonly estimated by counting the number of elementary operations performed by the algorithm, assuming that each elementary operation takes a fixed amount of time to perform.

Context / Usage

  • Expressed using Big O Notation.
  • Critical for evaluating algorithm efficiency and scalability.

Relationships