(*common name constant log logarithmic linear log log linear quadratic cubic an exponential table common big- functions listed from smallest to largest order of magnitude log log figure growth rates of the common time-complexity functions any algorithm whose time-complexity is (loga nthese algorithms are generally very efficient since loga will increase more slowly than for many problems encountered in computer science will typically equal and thus we use the notation log to imply log logarithms of other bases will be explicitly stated polynomial algorithms with an efficiency expressed as polynomial of the form am nm am- nm-