|
 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • |
Aggregate
Method
|
|
|
|
– |
Determine total
time T(n) for
|
|
|
|
all n operations
|
|
|
|
– |
Amortized time is
T(n)/n
|
|
|
| • |
Accounting
Method
|
|
|
|
– |
Uses a scheme of credits
|
|
|
|
charged to each
operation
|
|
|
|
– |
Credits “reside”
within data
|
|
|
|
structure and
are available
|
|
|
|
to pay for
operations
|
|
|
| • |
Potential
Method
|
|
|
|
– |
Maintains a
“potential
|
|
|
|
energy” of the
data structure
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • |
Amortization
has no effect
|
|
|
on
the algorithm itself
|
|
|
|
– |
Strictly
an analysis
|
|
|
|
technique
|
|
|
| • |
We’ll
mostly use the
|
|
|
|
Accounting
Method
|
|
|
|
– |
No
credits appear in the
|
|
|
|
algorithm
|
|
|
|
– |
Credits
are strictly an
|
|
|
|
analysis
technique
|
|
|
|
– |
Credits
provide a way of
|
|
|
|
trading
running-time
|
|
|
|
between
operations
|
|
|
|