Time Complexity

  • Explain what is meant by asymptotic complexity analysis of an algorithm.

Asymptotic analysis (or asymptotic complexity analysis) uses asymptotic notation (like Big-Oh) to describe the computational complexity of an algorithm.

The computational complexity of an algorithm is (generally) about how it consumes computational resources, namely time complexity and space complexity.

Time complexity measures the amount of time an algorithm needs to run as a function of its input size.

We've measured time complexity so far. Next, we will look at space complexity!

Resources