Informally, an algorithm can be side two exhibit growth rate on the order of mathematical function if beyond a certain input size n, the function f (n) times a positive constant provides an upper bound or limit for the run-time of that algorithm. In order words, for a given input size n greater than some n⁰ and a constant c, the running time of that algorithm will never be larger than: