A set of

operations on a

data type is said to have

*amortized time complexity* `f(n)` for

`n` operations if

*any* sequence of

`n` (legal) operations on it can be executed in

time `n f(n)`. This precisely means that the

*average* time to

execute any operation in the sequence is

`f(n)`.