Time complexity refers to the amount of time it takes for an algorithm to run, as the size of the input increases. It indicates how efficiently an algorithm solves a problem.
Related terms
Space Complexity: This term refers to the amount of memory or storage space that an algorithm requires to solve a problem.
Big O Notation: This notation describes the upper bound or worst-case scenario of an algorithm's time complexity.