# Amortized time complexity

Amortized analysis is used for algorithms that have **expensive operations** that happen only **rarely**.

Amortized complexity analysis is most commonly used with data structures that have state that persists between operations. The basic idea is that an expensive operation can alter the state so that the worst case cannot occur again for a long time, thus amortizing its cost.

Let T_{1}, T_{2}, …, T_{k}be the complexities of a sequence of operations on a data structuture. Theamortized complexityof a single operation in this sequence is (T_{1}+ T_{2}+ …+ T_{k}) / k.

## Example

```
// Append x to the end of array a.
```**algorithm** append(x, a):
**if** a.len == a.cap
b ← new array with twice the capacity of a
copy a into b
a ← b
a[a.len] ← x
a.len++

### Worst-case time

The worst-case time complexity for appending an element
to an array of length *n*, using this algorithm, is Θ(*n*).
If the array is full, the algorithm allocates a new array of length 2*n*,
and then copies the elements from the old array into the new one.

Cleary this result is overly pessimistic.
The following *n* append operations will be much cheaper –
each of them will run in constant time since the newly allocated array
has room for all the new elements.

### Amortized time

An amortized time analysis gives a much better understanding of the algorithm.

Consider a sequence of *n* append operations,
where we start with an array of length 1. A careful analysis shows
that the total time of these operations is only Θ(*n*).

- There will be a total of
*n*constant-time assignment and increment operations. - The resizing will happen only at operation 1, 2, 4, …, 2
^{k}, for a total of 1 + 2 + 4 + …+ 2^{k}= 2·2^{k}- 1 constant-time element copy operations. Since 2^{k}≤*n*, this is at most 2*n*- 1.

Hence, the amortized time complexity for a single append operation is Θ(1).