amortized analysis

For other uses of the term "Amortization", see Amortization. In computer science, especially analysis of algorithms, amortized analysis refers to finding the average running time per operation over a worst-case sequence of operations. Amortized analysis differs from average-case performance in that probability is not involved; amortized analysis guarantees the time per operation over worst-case performance.
See more at Wikipedia.org...