of [[Algorithm for Computational Problem]]. time complexity is generally expressed as a function of the size of the input this function is generally difficult to compute exactly, and the running time for small inputs is usually not consequential, one commonly focuses the [[Asymptotic Notations|asymptotic behaviour]] of the complexity. # Types - [[Worst-case Running Time of Algorithm]]; - [[Best cast complexity]]; - [[Average-case complexity]];