In computational complexity theory, Amortized analysis is the time per operation averaged 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.
There are several techniques used in Amortized analysis:
Aggregate analysis[?] - determines upper bound T(n) on total cost of sequence of n operations, then calculates average cost to be T(n)/n
... out with 25.6% under the age of 18, 7.5% from 18 to 24, 33.8% from 25 to 44, 21.3% from 45 to 64, and 11.8% who are 65 years of age or older. The median age is 36 ...