Akra and Bazzi generalized one method to compute this when a certain function is bounded by x over log x squared.
Akra and Bazzi generalized one method to compute this when a certain function is bounded by x over log x squared. Other computationS of this use either the uniform cost model or the logarithmic cost model. Recurrence relations of the form T of n equals T of n over b plus f of n can be solved for this using the Master theorem.  Amortization allows this to represent a weighted average of different conditions. Quicksort is notable for being in one class of this type corresponding to n log n, and this can be considered the algorithmic version of complexity classes.  FTP, name this notation used to give an asymptotic upper bound on the running time of algorithms.
Akra and Bazzi generalized one method to compute this when a certain function is bounded by x over log x squared.
Big O Notation [accept big omicron notation, prompt on "asymptotic" notation before mentioned, be picky and do not accept "big omega notation" or "big theta"]