Intro

In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. [1]

Big O [3]

Computational Complexity

  • : Constant time
  • : Iterated logarithmic time
  • : Linear time
  • : Linearithmic time
  • ²: Quadratic time
  • : Exponential time
  • : Factorial time

Cheat Sheet [2]

Reference